Sciweavers

42230 search results - page 414 / 8446
» Algorithms and Complexity Results for
Sort
View
COMBINATORICS
2002
107views more  COMBINATORICS 2002»
15 years 6 months ago
Combinatorial Laplacian of the Matching Complex
A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of the matching complex into irreducibles that are self-conjugate. We...
Xun Dong, Michelle L. Wachs
176
Voted
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 7 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
STOC
1994
ACM
123views Algorithms» more  STOC 1994»
15 years 11 months ago
Natural proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
Alexander A. Razborov, Steven Rudich
ICC
2007
IEEE
120views Communications» more  ICC 2007»
16 years 1 months ago
Turbo Equalization for Clipped and Filtered COFDM Signals
— Clipping and filtering is an attractive method for the reduction of the PAPR of OFDM signals before transmission. However, the resulting in-band distortion noise impacts the e...
Peter Zillmann, Wolfgang Rave, Gerhard Fettweis
IPPS
2003
IEEE
16 years 4 days ago
A Genetic Approach to Planning in Heterogeneous Computing Environments
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...