2069 search results - page 309 / 414 » Linear time algorithms for Clobber |
182
click to vote
MIS
2004
Springer
15 years 11 months ago
2004
Springer
When similarity queries over multimedia databases are processed by splitting the overall query condition into a set of sub-queries, the problem of how to efficiently and effectiv...
158
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
172
click to vote
IJRR
2002
15 years 6 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
174
click to vote
ICA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...
173
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...