16404 search results - page 610 / 3281 » A set coverage problem |
183
click to vote
TCS
2010
15 years 5 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
185
click to vote
JGO
2008
15 years 7 months ago
2008
Abstract I will report on some recent developments concerning the problem of estimating the Hausdorff dimension of the singular sets of solutions to elliptic and variational proble...
208
click to vote
SIGMOD
2000
ACM
15 years 11 months ago
2000
ACM
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
228
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We study the scheduling problem on unrelated machines in the mechanism design setting. This problem was proposed and studied in the seminal paper of Nisan and
538
click to vote
Publication
In this paper, we propose a new visualization technique for virtual
colonoscopy (VC). The proposed method is called Virtual Fly-Over, which splits
the entire colon anatomy into e...