Sciweavers

4463 search results - page 860 / 893
» computer 2000
Sort
View
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
13 years 10 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 2 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
LREC
2010
160views Education» more  LREC 2010»
13 years 11 months ago
FrAG, a Hybrid Constraint Grammar Parser for French
This paper describes a hybrid tagger/parser for French (FrAG), and presents results from ongoing development work, corpus annotation and evaluation. The core of the system is a se...
Eckhard Bick
JASIS
2000
143views more  JASIS 2000»
13 years 9 months ago
Discovering knowledge from noisy databases using genetic programming
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Man Leung Wong, Kwong-Sak Leung, Jack C. Y. Cheng
EDBT
2000
ACM
14 years 1 months ago
Temporal View Self-Maintenance
Warehouse view self-maintenance refers to maintaining materialized views at a data warehouse without accessing source data. Self-maintenance has been studied for nontemporal views...
Jun Yang 0001, Jennifer Widom