9572 search results - page 61 / 1915 » Cover Algorithms and Their Combination |
ANTSW
2006
Springer
14 years 1 months ago
2006
Springer
We present an algorithm for covering continuous domains by primitive robots whose only ability is to mark visited places with pheromone and to sense the level of the pheromone in t...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
JMLR
2002
13 years 9 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
SIAMCOMP
1998
13 years 9 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
MMSP
2008
IEEE
14 years 4 months ago
2008
IEEE
A new chroma-based dynamic feature vector is proposed inspired by psychophysical observations that the human auditory system detects relative pitch changes rather than absolute pi...