746 search results - page 20 / 150 » Fast (Structured) Newton Computations |
64
Voted
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) inde...
DCC
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract--Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. It is known that for ...
IJON
2006
14 years 9 months ago
2006
There is a trend to develop blind or semi-blind source extraction algorithms based on second-order statistics, due to its low computation load and fast processing speed. An import...
77
Voted
KDD
1998
ACM
15 years 1 months ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
84
Voted
BMVC
2002
15 years 1 days ago
2002
Bundle adjustment is one of the cornerstone to recover the scene structure from a sequence of images. The main drawback of this technique, due to nonlinear optimisation, is the ne...