Sciweavers

354 search results - page 61 / 71
» The Chromatic Number Of Graph Powers
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 7 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
NIPS
2004
13 years 8 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
CORR
2007
Springer
134views Education» more  CORR 2007»
13 years 7 months ago
Rate-Constrained Wireless Networks with Fading Channels: Interference-Limited and Noise-Limited Regimes
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
Masoud Ebrahimi, Amir K. Khandani
VLSID
2002
IEEE
136views VLSI» more  VLSID 2002»
14 years 7 months ago
Buffered Routing Tree Construction under Buffer Placement Blockages
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
Wei Chen, Massoud Pedram, Premal Buch
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
13 years 11 months ago
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
Hongbing Fan, Jiping Liu, Yu-Liang Wu