2957 search results - page 268 / 592 » The Complexity of Polynomial-Time Approximation |
228
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
182
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
147
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
179
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
160
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...