2520 search results - page 341 / 504 » The complexity of approximating entropy |
136
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
141
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— Robotic motion planning requires configuration space exploration. In high-dimensional configuration spaces, a complete exploration is computationally intractable. Practical m...
154
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
151
click to vote
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard binary classifiers, RankOpt adopts the AUC stat...
149
click to vote
XSYM
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...