204 search results - page 24 / 41 » Parameterizations of Test Cover with Bounded Test Sizes |
127
click to vote
TAINN
2005
Springer
15 years 3 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
AROBOTS
2004
2004
Propagation of Uncertainty in Cooperative Multirobot Localization: Analysis and Experimental Results
14 years 10 months ago
This paper examines the problem of cooperative localization for the case of large groups of mobile robots. A Kalman filter estimator is implemented and tested for this purpose. The...
116
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, ...
CCCG
2008
14 years 12 months ago
2008
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...