Sciweavers

220 search results - page 32 / 44
» A Pseudo-Metric for Weighted Point Sets
Sort
View
MLDM
2005
Springer
14 years 1 months ago
Using Clustering to Learn Distance Functions for Supervised Similarity Assessment
Assessing the similarity between objects is a prerequisite for many data mining techniques. This paper introduces a novel approach to learn distance functions that maximizes the c...
Christoph F. Eick, Alain Rouhana, Abraham Bagherje...
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 8 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 5 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
TON
1998
103views more  TON 1998»
13 years 8 months ago
Using name-based mappings to increase hit rates
—Clusters of identical intermediate servers are often created to improve availability and robustness in many domains. The use of proxy servers for the World Wide Web (WWW) and of...
David Thaler, Chinya V. Ravishankar
MOBICOM
2009
ACM
14 years 2 months ago
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
Gaurav S. Kasbekar, Yigal Bejerano, Saswati Sarkar