2924 search results - page 253 / 585 » Lower Bounds in Distributed Computing |
173
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
164
click to vote
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
134
click to vote
AIPS
2008
15 years 6 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
147
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
146
Voted
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
In some application domains, such as medical imaging, the objects that compose the scene are known as well as some of their properties and their spatial arrangement. We can take ad...