1989 search results - page 252 / 398 » cost 2010 |
172
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
167
click to vote
CAV
2010
Springer
15 years 9 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
198
click to vote
DEBS
2010
ACM
15 years 9 months ago
2010
ACM
An effective means for building Internet-scale distributed applications, and in particular those involving group-based information sharing, is to deploy peer-to-peer overlay netwo...
165
click to vote
EDBT
2010
ACM
15 years 9 months ago
2010
ACM
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
161
click to vote
EDBTW
2010
Springer
15 years 9 months ago
2010
Springer
The vision of dataspaces has been articulated as providing various of the benefits of classical data integration but with reduced up-front costs, which, combined with opportunitie...