Sciweavers

2376 search results - page 165 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
ICML
2004
IEEE
14 years 8 months ago
The Bayesian backfitting relevance vector machine
Traditional non-parametric statistical learning techniques are often computationally attractive, but lack the same generalization and model selection abilities as state-of-the-art...
Aaron D'Souza, Sethu Vijayakumar, Stefan Schaal
RECOMB
2002
Springer
14 years 8 months ago
Provably sensitive Indexing strategies for biosequence similarity search
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
Jeremy Buhler
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
14 years 8 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
EDBT
2008
ACM
159views Database» more  EDBT 2008»
14 years 8 months ago
Automaton in or out: run-time plan optimization for XML stream processing
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
Hong Su, Elke A. Rundensteiner, Murali Mani
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
14 years 2 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta