Sciweavers

454 search results - page 78 / 91
» On improving approximate solutions by evolutionary algorithm...
Sort
View
159
Voted
COMPGEOM
2009
ACM
15 years 11 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
ISBRA
2009
Springer
16 years 5 hour ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
124
Voted
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
15 years 10 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 7 days ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
CVPR
2004
IEEE
16 years 7 months ago
A Graphical Model Framework for Coupling MRFs and Deformable Models
This paper proposes a new framework for image segmentation based on the integration of MRFs and deformable models using graphical models. We first construct a graphical model to r...
Rui Huang, Vladimir Pavlovic, Dimitris N. Metaxas