Sciweavers

5115 search results - page 440 / 1023
» On Randomized Lanczos Algorithms
Sort
View
ICPR
2004
IEEE
16 years 8 months ago
Pattern Matching by Sequential Subdivision of Transformation Space
Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision...
Mingtian Ni, Stephen E. Reichenbach
ICML
2009
IEEE
16 years 8 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
16 years 8 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 8 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
DCC
2003
IEEE
16 years 7 months ago
Estimation-Quantization Geometry Coding Using Normal Meshes
We propose a new algorithm for compressing three-dimensional triangular mesh data used for representing surfaces. We apply the EstimationQuantization (EQ) algorithm originally des...
Sridhar Lavu, Hyeokho Choi, Richard G. Baraniuk