2168 search results - page 59 / 434 » Randomized Algorithms and Complexity Theory |
107
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Recent research has revealed that circularity (or, propriety) of complex random signals can be exploited in developing optimal signal processors. In this paper, a robust estimator...
96
Voted
JC
2006
15 years 2 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
172
click to vote
STOC
2000
ACM
15 years 7 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
150
click to vote
JMLR
2012
13 years 5 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
106
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...