1332 search results - page 48 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
SIAMDM
2010
13 years 3 months ago
2010
Let A be a 0/1 matrix of size m
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
ICALP
2000
Springer
14 years 3 days ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
CCE
2004
13 years 8 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...