1778 search results - page 146 / 356 » On the Power of the Randomized Iterate |
145
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
164
click to vote
STOC
1991
ACM
15 years 10 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
146
click to vote
NIPS
2001
15 years 7 months ago
2001
This paper describes a clustering algorithm for vector quantizers using a "stochastic association model". It offers a new simple and powerful softmax adaptation rule. Th...
169
click to vote
MST
2006
15 years 6 months ago
2006
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
190
click to vote
SECON
2007
IEEE
16 years 22 days ago
2007
IEEE
—Wireless Sensor Networks (WSNs) require robustness against channel induced errors while retransmission based schemes prove too costly for energy constrained sensor nodes. Channe...