Sciweavers

1523 search results - page 300 / 305
» The Computational Complexity of Linear Optics
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
13 years 12 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
VLDB
1998
ACM
180views Database» more  VLDB 1998»
13 years 11 months ago
Active Storage for Large-Scale Data Mining and Multimedia
The increasing performance and decreasing cost of processors and memory are causing system intelligence to move into peripherals from the CPU. Storage system designers are using t...
Erik Riedel, Garth A. Gibson, Christos Faloutsos
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
13 years 11 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
ICB
2007
Springer
183views Biometrics» more  ICB 2007»
13 years 11 months ago
Robust Point-Based Feature Fingerprint Segmentation Algorithm
Abstract. A critical step in automatic fingerprint recognition is the accurate segmentation of fingerprint images. The objective of fingerprint segmentation is to decide which part...
Chaohong Wu, Sergey Tulyakov, Venu Govindaraju
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti