4385 search results - page 261 / 877 » Abstraction for Concurrent Objects |
174
Voted
ICCSA
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
102
click to vote
GLOBECOM
2006
IEEE
16 years 5 days ago
2006
IEEE
Abstract— Many emerging applications for peer to peer overlays may require nodes to satisfy strict timing deadlines to access a replica of a given object. This includes multimedi...
133
click to vote
ACCV
2006
Springer
16 years 3 days ago
2006
Springer
Abstract. We present an alignment framework for object detection using a hierarchy of 3D polygonal models. One difficulty with alignment methods is that the high-dimensional transf...
156
click to vote
EMMCVPR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
169
Voted
OOPSLA
2005
Springer
15 years 11 months ago
2005
Springer
Currently, the most adopted criterion to invoke garbage collection is heap space exhaustion. In other words, garbage collection is invoked when the heap space (either the entire s...