21324 search results - page 428 / 4265 » Making the case for computing |
204
click to vote
CGF
2010
15 years 6 months ago
2010
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
173
Voted
TPDS
1998
15 years 6 months ago
1998
—Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, ...
189
Voted
ML
2007
ACM
15 years 6 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
173
click to vote
HOTNETS
2010
15 years 1 months ago
2010
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
163
click to vote
WADS
2005
Springer
16 years 5 days ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...