2168 search results - page 200 / 434 » Randomized Algorithms and Complexity Theory |
134
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
100
Voted
PICS
2001
15 years 5 months ago
2001
A first television system based on the Autosophy information theory is now being tested. The new television marks a major theoretical break from conventional television based on t...
139
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We consider the task of under-determined reverberant audio source separation. We model the contribution of each source to all mixture channels in the time-frequency domain as a ze...
125
Voted
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
15 years 3 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
137
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...