Browsing by Author "Chen, Jianer"
Now showing items 1-20 of 83
-
Yu, Sijing (2023-08-07)In graph clustering, ratio cut objectives represent the ratio between the connectivity of the subgraph and some notation of the graph properties including size and density. These ratio cut objectives are widely studied and ...
-
Yu, Sijing (2023-08-07)In graph clustering, ratio cut objectives represent the ratio between the connectivity of the subgraph and some notation of the graph properties including size and density. These ratio cut objectives are widely studied and ...
-
Yu, Sijing (2023-08-07)In graph clustering, ratio cut objectives represent the ratio between the connectivity of the subgraph and some notation of the graph properties including size and density. These ratio cut objectives are widely studied and ...
-
Huang, Qin (2022-07-26)In this thesis, we will propose a new (theoretical) computational model to study massive data processing. Our model has limited “local" computing resources (e.g., a normal computer) that characterizes the computational ...
-
Warrier, Deepak (Texas A&M University, 2007-09-17)The maximum weight-independent set problem (MWISP) is one of the most well-known and well-studied NP-hard problems in the field of combinatorial optimization. In the first part of the dissertation, I explore efficient ...
-
Rice, Grant G., III (Texas A&M University, 2006-04-12)The objective of my research is to identify and analyze the techniques of exaggeration, simplification, and abstraction used by caricature and cartoon artists. I apply these techniques to an expressive 3D modelling process ...
-
Cai, Liming; Chen, Jianer; Håstad, Johan (SIAM Journal on Computing, 1998)
-
Cao, Yixin (2012-07-16)Clustering is the unsupervised classification of patterns into groups, which is easy provided the data of patterns are consistent. However, real data are almost always tempered with inconsistencies, which make it a hard ...
-
Cao, Cheng (2017-12-08)Social media encourages user participation and facilitates user’s self-expression like never before. While enriching user behavior in a spectrum of means, many social media platforms have become breeding grounds for user ...
-
Kumar, Krishna (Texas A&M University. Libraries, 1993)This dissertation is concerned with the combinatorics of visibility graphs of simple polygons. We seek to obtain combinatorial properties that characterize such visibility graphs. A key algorithmic problem that arises in ...
-
Viqar, Saira (2012-10-19)In this dissertation we present deterministic algorithms for reliable and efficient communication in ad hoc networks. In the first part of this dissertation we give a specification for a reliable neighbor discovery layer ...
-
Pandey, Nikhil (2012-07-16)Graph decompositions have useful applications in optimization problems that are categorized as NP-Hard. Modular Decomposition of a graph is a technique to decompose the graph into non-overlapping modules. A module M of ...
-
Fan, Jia-Hao (2013-07-23)Both the maximum agreement forest problem and the multicut on trees problem are NP-hard, thus cannot be solved efficiently if P /=NP. The maximum agreement forest problem was motivated in the study of evolution trees in ...
-
Chen, Yu (Texas A&M University, 2006-10-30)This dissertation focuses on the design and analysis of distributed primitives for mobile ad hoc networks, in which mobile hosts are free to move arbitrarily. Arbitrary mobility adds unpredictability to the topology changes ...
-
Luo, Ping (2010-01-14)The k-path problem is to find a simple path of length k. This problem is NP-complete and has applications in bioinformatics for detecting signaling pathways in protein interaction networks and for biological subnetwork ...
-
Subramanian, Sivaramakrishnan (2009-05-15)Mobile ad hoc networks consist of potentially moving, computing nodes that communicate via radio and do not have access to any fixed infrastructure. The knowl- edge about nearby nodes is a fundamental requirement and is ...
-
Wang, Yanjun (Texas A&M University, 2005-02-17)There has been growing public concern regarding the threat to people and environment from industrial activities, thus more rigorous regulations. The investigation of almost all the major accidents shows that we could ...
-
He, Lei (2014-08-18)Extracting valuable information from 2D or 3D visual data plays an important role in image and geometry processing. Surfaces obtained through a scanning process or other reconstruction algorithms are inevitably noisy due ...
-
Yu, Fangqing (Texas A&M University, 2004-09-30)This thesis describes a divide-and-conquer algorithm to improve the 3D boundary element method (BEM) for capacitance extraction. We divide large interconnect structures into small sections, set new boundary conditions using ...
-
Garigipati, Pradeep (2013-04-22)In this thesis work, our main motivation is to create computer aided art work which can eventually transform into a sculpting tool. The work was inspired after Taubin’s work on constructing Hamiltonian triangle strips on ...