185 search results - page 25 / 37 » A Simple Min Cut Algorithm |
81
Voted
GRAPHICSINTERFACE
2000
15 years 3 months ago
2000
We present a method to incrementally voxelize triangles into a volumetric dataset with pre-filtering, generating an accurate multivalued voxelization. Multivalued voxelization all...
114
Voted
PODS
2001
ACM
16 years 2 months ago
2001
ACM
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
118
Voted
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
128
Voted
ADHOCNOW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
143
Voted
ICCAD
2001
IEEE
15 years 11 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...