Sciweavers

6693 search results - page 948 / 1339
» Methods of Automatic Algorithm Generation
Sort
View
AI
2008
Springer
15 years 4 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
RAS
2008
135views more  RAS 2008»
15 years 3 months ago
Constructing dependable certainty grids from unreliable sensor data
-- Measurements from sensors as they are used for robotic grid map applications typically show behavior like degradation or discalibration over time, which affects the quality of t...
Wilfried Elmenreich
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 4 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 4 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
CVPR
2008
IEEE
16 years 6 months ago
Unsupervised discovery of visual object class hierarchies
Objects in the world can be arranged into a hierarchy based on their semantic meaning (e.g. organism ? animal ? feline ? cat). What about defining a hierarchy based on the visual ...
Josef Sivic, Bryan C. Russell, Andrew Zisserman, W...