746 search results - page 30 / 150 » Fast (Structured) Newton Computations |
ECCV
2010
Springer
13 years 9 months ago
2010
Springer
In order for recognition systems to scale to a larger number of object categories building visual class taxonomies is important to achieve running times logarithmic in the number o...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
ACSC
2007
IEEE
14 years 2 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
ICPR
2002
IEEE
14 years 20 days ago
2002
IEEE
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...
IPPS
1997
IEEE
13 years 12 months ago
1997
IEEE
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...