Sciweavers

1046 search results - page 65 / 210
» Approximation Algorithms for Domination Search
Sort
View
HIPC
2007
Springer
15 years 6 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CN
1999
73views more  CN 1999»
15 years 2 months ago
Measuring Index Quality Using Random Walks on the Web
Recent researchhas studied howto measurethe size of a searchengine, in terms of the number of pages indexed. In this paper, we consider a di erent measure for search engines, name...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
134
Voted
SIGIR
2005
ACM
15 years 8 months ago
Personalizing search via automated analysis of interests and activities
We formulate and study search algorithms that consider a user’s prior interactions with a wide variety of content to personalize that user’s current Web search. Rather than re...
Jaime Teevan, Susan T. Dumais, Eric Horvitz
118
Voted
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
15 years 9 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
130
Voted
MICAI
2005
Springer
15 years 8 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...