Sciweavers

5164 search results - page 568 / 1033
» Consistency of the EKF-SLAM Algorithm
Sort
View
COLT
2004
Springer
15 years 11 months ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
ECAI
2010
Springer
15 years 8 months ago
Parallel TBox Classification in Description Logics - First Experimental Results
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
Mina Aslani, Volker Haarslev
BMCBI
2006
116views more  BMCBI 2006»
15 years 7 months ago
Integrative missing value estimation for microarray data
Background: Missing value estimation is an important preprocessing step in microarray analysis. Although several methods have been developed to solve this problem, their performan...
Jianjun Hu, Haifeng Li, Michael S. Waterman, Xiang...
CANDC
2006
ACM
15 years 7 months ago
Dealing with repetitions in sequencing by hybridization
DNA sequencing by hybridization (SBH) induces errors in the biochemical experiment. Some of them are random and disappear when the experiment is repeated. Others are systematic, i...
Jacek Blazewicz, Fred Glover, Marta Kasprzak, Wojc...
IJAC
2007
116views more  IJAC 2007»
15 years 7 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil