1805 search results - page 327 / 361 » A Theory of Closure Operators |
145
click to vote
CVPR
2010
IEEE
16 years 14 days ago
2010
IEEE
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
144
Voted
STACS
2010
Springer
15 years 11 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
140
click to vote
PODC
2009
ACM
15 years 10 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
134
click to vote
SAC
2009
ACM
15 years 10 months ago
2009
ACM
In this paper we propose an attention-based vision system for the JAST interactive dialog robot. The robotic vision system incorporates three submodules: object recognition, gestu...
132
click to vote
CLUSTER
2009
IEEE
15 years 10 months ago
2009
IEEE
—With the advent of Cloud computing, large-scale virtualized compute and data centers are becoming common in the computing industry. These distributed systems leverage commodity ...