2254 search results - page 246 / 451 » Computing the minimal covering set |
163
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...
171
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
287
click to vote
GIS
2007
ACM
16 years 7 months ago
2007
ACM
We present the GeoStar project at RPI, which researches various terrain (i.e., elevation) representations and operations thereon. This work is motivated by the large amounts of hi...
171
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
170
click to vote
TAMC
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...