5138 search results - page 53 / 1028 » Randomized Algorithms for 3-SAT |
156
click to vote
OL
2011
14 years 8 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
107
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
SAGA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Devices connected wirelessly, in various forms including computers, hand-held devices, ad hoc networks, and embedded systems, are expected to become ubiquitous all around...
113
click to vote
COMPGEOM
1993
ACM
15 years 5 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
107
click to vote
BILDMED
2008
15 years 3 months ago
2008
In this paper we present a new method for fully automatic liver segmentation in computed tomography images. First, an initial set of seed points for the random walker algorithm is ...