Sciweavers

75 search results - page 14 / 15
» Triangle Fixing Algorithms for the Metric Nearness Problem
Sort
View
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
14 years 9 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
IJRR
2002
105views more  IJRR 2002»
13 years 8 months ago
Computing Wrench Cones for Planar Rigid Body Contact Tasks
The contribution of this paper is the expansion of the range of possibilities in the analysis, planning, and control of contact tasks. The successful execution of any contact task...
Devin J. Balkcom, Jeffrey C. Trinkle
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
13 years 3 months ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
14 years 10 days ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 6 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon