194 search results - page 20 / 39 » Computing Roundness is Easy if the Set is Almost Round |
191
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
127
click to vote
CONEXT
2009
ACM
15 years 7 months ago
2009
ACM
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as...
150
click to vote
FOCS
2006
IEEE
16 years 1 days ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
154
click to vote
MICCAI
2010
Springer
15 years 4 months ago
2010
Springer
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
169
click to vote
VLSID
2006
IEEE
15 years 12 months ago
2006
IEEE
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...