149 search results - page 21 / 30 » Uniform hashing in constant time and linear space |
DAGSTUHL
2006
13 years 10 months ago
2006
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
Abstract. Configurations of dynamic points in multiple views are interesting to study. In this paper, we present several view and timeindependent constraints on different configura...
IDA
2002
Springer
13 years 8 months ago
2002
Springer
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...