9842 search results - page 1305 / 1969 » The Complexity of the Matching-Cut Problem |
218
Voted
DAGM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
222
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
198
click to vote
ATAL
2006
Springer
15 years 11 months ago
2006
Springer
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
192
Voted
DSN
2004
IEEE
15 years 11 months ago
2004
IEEE
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
229
Voted
CIKM
2006
Springer
15 years 11 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...