986 search results - page 135 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
186
click to vote
CORR
2011
Springer
15 years 18 days ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
146
click to vote
CIC
2004
15 years 7 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
138
Voted
SPIRE
2007
Springer
15 years 11 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
141
Voted
PVLDB
2010
15 years 4 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
142
click to vote
IROS
2007
IEEE
15 years 12 months ago
2007
IEEE
—This paper describes efficient utilization of human time by two means: prioritization of human tasks and maximizing multirobot team size. We propose an efficient scheduling algo...