3055 search results - page 540 / 611 » Randomized Search Trees |
109
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
121
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
125
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
130
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
104
Voted
SIGIR
2009
ACM
15 years 9 months ago
2009
ACM
Documents in many corpora, such as digital libraries and webpages, contain both content and link information. To explicitly consider the document relations represented by links, i...