Sciweavers

3780 search results - page 67 / 756
» Algorithms for Game Metrics
Sort
View
112
Voted
SBBD
2007
148views Database» more  SBBD 2007»
15 years 1 months ago
Bulk-loading Dynamic Metric Access Methods
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...
Thiago Galbiatti Vespa, Caetano Traina Jr., Agma J...
TKDE
2002
109views more  TKDE 2002»
15 years 4 days ago
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
Caetano Traina Jr., Agma J. M. Traina, Christos Fa...
CVPR
2003
IEEE
16 years 2 months ago
Many-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...
125
Voted
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
15 years 1 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
15 years 1 months ago
A note on the nearest neighbor in growth-restricted metrics
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...