2107 search results - page 246 / 422 » Computing Small Search Numbers in Linear Time |
SIGGRAPH
2010
ACM
14 years 1 months ago
2010
ACM
High-order and regularly sampled surface representations are more efficient and compact than general meshes and considerably simplify many geometric modeling and processing algor...
ALGORITHMICA
2005
13 years 9 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Shape warping is a key problem in statistical shape analysis. This paper proposes a framework for geometric shape warping based on both shape distances and landmarks. Our method i...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...