Sciweavers

631 search results - page 120 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 5 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
CIKM
2007
Springer
14 years 1 months ago
Hybrid results merging
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
Georgios Paltoglou, Michail Salampasis, Maria Satr...
EMSOFT
2007
Springer
14 years 1 months ago
Optimal task placement to improve cache performance
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
Gernot Gebhard, Sebastian Altmeyer
ISSRE
2006
IEEE
14 years 1 months ago
Queuing Models for Field Defect Resolution Process
This paper explores a novel application of queuing theory to the corrective software maintenance problem to support quantitative balancing between resources and responsiveness. In...
Swapna S. Gokhale, Robert E. Mullen
ANCS
2005
ACM
14 years 1 months ago
SSA: a power and memory efficient scheme to multi-match packet classification
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
Fang Yu, T. V. Lakshman, Martin Austin Motoyama, R...