90 search results - page 12 / 18 » ccr 2006 |
COMPGEOM
2006
ACM
14 years 8 days ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
MP
1998
13 years 8 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
PLDI
2006
ACM
14 years 2 months ago
2006
ACM
Garbage collection has proven benefits, including fewer memoryrelated errors and reduced programmer effort. Garbage collection, however, trades space for time. It reclaims memory...
ASPLOS
2006
ACM
14 years 2 months ago
2006
ACM
Memory leaks compromise availability and security by crippling performance and crashing programs. Leaks are difficult to diagnose because they have no immediate symptoms. Online ...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...