Sciweavers

1541 search results - page 179 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
AAAI
2011
12 years 8 months ago
Quantity Makes Quality: Learning with Partial Views
In many real world applications, the number of examples to learn from is plentiful, but we can only obtain limited information on each individual example. We study the possibiliti...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
14 years 8 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
CATS
2008
13 years 9 months ago
On the Efficiency of Pollard's Rho Method for Discrete Logarithms
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
Shi Bai, Richard P. Brent
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 9 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
GLVLSI
2005
IEEE
118views VLSI» more  GLVLSI 2005»
14 years 1 months ago
High-diagnosability online built-in self-test of FPGAs via iterative bootstrapping
We develop a novel on-line built-in self-test (BIST) technique for testing FPGAs that has a very high diagnosability even in presence of clustered faults, a fault pattern for whic...
Vishal Suthar, Shantanu Dutt