192 search results - page 25 / 39 » Using SAT-Solvers to Compute Inference-Proof Database Instan... |
85
Voted
AAAI
2010
15 years 1 months ago
2010
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
121
click to vote
SG
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Utilizing context information—e.g. location, user aspects, or hardware capabilities—enables the presented generic framework to automatically control the selection and...
115
Voted
CLUSTER
2004
IEEE
15 years 3 months ago
2004
IEEE
A key challenge in supporting data-driven scientific applications is the storage and management of input and output data in a distributed environment. In this paper, we describe a...
ICPR
2006
IEEE
16 years 23 days ago
2006
IEEE
In this work we propose a probabilistic model for generic object classification from raw range images. Our approach supports a validation process in which classes are verified usi...
111
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...