Sciweavers

251 search results - page 33 / 51
» When Size Does Matter
Sort
View
ICRA
1999
IEEE
138views Robotics» more  ICRA 1999»
13 years 11 months ago
Efficient Topological Exploration
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
Ioannis M. Rekleitis, Vida Dujmovic, Gregory Dudek
KDD
2000
ACM
142views Data Mining» more  KDD 2000»
13 years 11 months ago
Automating exploratory data analysis for efficient data mining
Having access to large data sets for the purpose of predictive data mining does not guarantee good models, even when the size of the training data is virtually unlimited. Instead,...
Jonathan D. Becher, Pavel Berkhin, Edmund Freeman
FOCS
1995
IEEE
13 years 11 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
DEXA
2005
Springer
111views Database» more  DEXA 2005»
13 years 9 months ago
On the General Signature Trees
The signature file method is a popular indexing technique used in information retrieval and databases. It excels in efficient index maintenance and lower space overhead. Different ...
Yangjun Chen
CP
2008
Springer
13 years 9 months ago
CPBPV: A Constraint-Programming Framework for Bounded Program Verification
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
Hélène Collavizza, Michel Rueher, Pa...