Sciweavers

200 search results - page 4 / 40
» A combinatorial approach to the power of 2 in the number of ...
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 9 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
ISPASS
2005
IEEE
14 years 2 months ago
Partitioning Multi-Threaded Processors with a Large Number of Threads
Today’s general-purpose processors are increasingly using multithreading in order to better leverage the additional on-chip real estate available with each technology generation...
Ali El-Moursy, Rajeev Garg, David H. Albonesi, San...
TCS
2008
13 years 8 months ago
Motif patterns in 2D
Motif patterns consisting of sequences of intermixed solid and don't care characters have been introduced and studied in connection with pattern discovery problems of computa...
Alberto Apostolico, Laxmi Parida, Simona E. Rombo
ICASSP
2011
IEEE
13 years 15 days ago
Mixed-integer linear programming framework for max-min power control with single-stage interference cancellation
We consider a wireless network comprising a number of mutuallyinterfering links. We study the transmit power control problem that determines the egalitarian signal-to-interference...
Eleftherios Karipidis, Di Yuan, Erik G. Larsson
CAD
2005
Springer
13 years 8 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...