2168 search results - page 330 / 434 » Randomized Algorithms and Complexity Theory |
134
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
130
click to vote
MST
2006
15 years 3 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
132
click to vote
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
153
click to vote
ICCV
1999
IEEE
16 years 5 months ago
1999
IEEE
The eikonal equation and variants of it are of significant interest for problems in computer vision and image processing. It is the basis for continuous versions of mathematical m...
140
click to vote
VIS
2004
IEEE
16 years 4 months ago
2004
IEEE
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...