986 search results - page 126 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
154
click to vote
RANDOM
1998
Springer
15 years 8 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
147
click to vote
SWAT
2000
Springer
15 years 7 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
137
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
136
click to vote
STACS
1999
Springer
15 years 8 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
154
click to vote
JMLR
2012
13 years 6 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...