Sciweavers

1651 search results - page 39 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ICRA
2007
IEEE
115views Robotics» more  ICRA 2007»
14 years 2 months ago
Sensor Selection Using Information Complexity for Multi-sensor Mobile Robot Localization
—Our sensor selection algorithm targets the problem of global self-localization of multi-sensor mobile robots. The algorithm builds on the probabilistic reasoning using Bayes fil...
Sreenivas R. Sukumar, Hamparsum Bozdogan, David L....
NIPS
2007
13 years 9 months ago
Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
M. M. Mahmud, Sylvian R. Ray
MICAI
2010
Springer
13 years 6 months ago
Recognizing Textual Entailment Using a Machine Learning Approach
We present our experiments on Recognizing Textual Entailment based on modeling the entailment relation as a classification problem. As features used to classify the entailment pair...
Miguel Angel Ríos Gaona, Alexander F. Gelbu...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 8 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
JSS
2000
97views more  JSS 2000»
13 years 7 months ago
Exploring the relationships between design measures and software quality in object-oriented systems
The first goal of this paper is to empirically explore the relationships between existing object-oriented coupling, cohesion, and inheritance measures and the probability of fault...
Lionel C. Briand, Jürgen Wüst, John W. D...