Sciweavers

1806 search results - page 158 / 362
» Randomness and halting probabilities
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 10 months ago
Learning Low-Density Separators
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
Shai Ben-David, Tyler Lu, Dávid Pál,...
ECCC
2006
96views more  ECCC 2006»
13 years 10 months ago
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---
Detecting the relevant attributes of an unknown target concept is an important and well studied problem in algorithmic learning. Simple greedy strategies have been proposed that s...
Jan Arpe, Rüdiger Reischuk
TCS
2008
13 years 10 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
PAMI
1998
86views more  PAMI 1998»
13 years 9 months ago
Spatial Sampling of Printed Patterns
—The bitmap obtained by scanning a printed pattern depends on the exact location of the scanning grid relative to the pattern. We consider ideal sampling with a regular lattice o...
Prateek Sarkar, George Nagy, Jiangying Zhou, Danie...
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
13 years 8 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang