Sciweavers

2996 search results - page 196 / 600
» Numberings and Randomness
Sort
View
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 8 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline
ICIP
2003
IEEE
16 years 8 months ago
Algorithms for stochastic approximations of curvature flows
Curvature flows have been extensively considered from a deterministic point of view. They have been shown to be useful for a number of applications including crystal growth, flame...
Gozde B. Unal, Delphine Nain, G. Ben-Arous, Nahum ...
ICPR
2000
IEEE
16 years 7 months ago
Measuring the Complexity of Classification Problems
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
Tin Kam Ho, Mitra Basu
DAC
2002
ACM
16 years 7 months ago
A general probabilistic framework for worst case timing analysis
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...
Michael Orshansky, Kurt Keutzer
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson