209 search results - page 34 / 42 » t-Spanners for metric space searching |
JBI
2004
14 years 8 days ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
IEAAIE
2001
Springer
14 years 3 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
MM
2000
ACM
14 years 3 months ago
2000
ACM
Query by key frame or video example is a convenient and often effective way to search in video database. This paper proposes a new approach to support such searches. The main cont...
RSP
1998
IEEE
14 years 3 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
ICML
2006
IEEE
14 years 7 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...