1449 search results - page 150 / 290 » Self-Randomized Exponentiation Algorithms |
146
click to vote
ICCAD
1998
IEEE
15 years 10 months ago
1998
IEEE
Due to the exponential growth of both design complexity and the number of gates per pin, functional debugging has emerged as a critical step in the development of a system-on-chip...
161
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
164
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
188
click to vote
ICNP
1997
IEEE
15 years 10 months ago
1997
IEEE
TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows than p...
190
click to vote
INFOVIS
1997
IEEE
15 years 10 months ago
1997
IEEE
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...