Sciweavers

746 search results - page 20 / 150
» Fast (Structured) Newton Computations
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
Improved Concurrency Control Techniques For Multi-Dimensional Index Structures
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...
Kothuri Venkata Ravi Kanth, David Serena, Ambuj K....
DCC
1999
IEEE
14 years 10 hour ago
Performance of Quantizers on Noisy Channels Using Structured Families of Codes
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 ...
András Méhes, Kenneth Zeger
IJON
2006
77views more  IJON 2006»
13 years 7 months ago
Robust extraction of specific signals with temporal structure
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...
Zhi-Lin Zhang, Zhang Yi
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
13 years 12 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
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...
Brigham S. Anderson, Andrew W. Moore
BMVC
2002
13 years 10 months ago
Bundle adjustment: a fast method with weak initialisation
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...
Sébastien Cornou, Michel Dhome, Patrick Say...