2598 search results - page 354 / 520 » Experimental Design for Variable Selection in Data Bases |
161
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
179
click to vote
APIN
2000
15 years 6 months ago
2000
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
171
click to vote
IPMI
2007
Springer
16 years 7 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
260
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
274
click to vote
VLDB
2004
ACM
16 years 6 months ago
2004
ACM
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...