Sciweavers

1568 search results - page 221 / 314
» The problem of examination questions in algorithmics
Sort
View
COLT
2003
Springer
15 years 11 months ago
Learning from Uncertain Data
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ļ¬...
Mehryar Mohri
VLDB
2001
ACM
109views Database» more  VLDB 2001»
15 years 10 months ago
Mining Multi-Dimensional Constrained Gradients in Data Cubes
Constrained gradient analysis (similar to the ā€œcubegradeā€ problem posed by Imielinski, et al. [9]) is to extract pairs of similar cell characteristics associated with big chan...
Guozhu Dong, Jiawei Han, Joyce M. W. Lam, Jian Pei...
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 10 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
COCO
1999
Springer
101views Algorithms» more  COCO 1999»
15 years 10 months ago
A Lower Bound for Primality
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
Eric Allender, Michael E. Saks, Igor Shparlinski
CCS
2006
ACM
15 years 10 months ago
Can machine learning be secure?
Machine learning systems offer unparalled flexibility in dealing with evolving input in a variety of applications, such as intrusion detection systems and spam e-mail filtering. H...
Marco Barreno, Blaine Nelson, Russell Sears, Antho...