Sciweavers

3758 search results - page 361 / 752
» A Complete Subsumption Algorithm
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 12 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
PAMI
2007
187views more  PAMI 2007»
15 years 6 months ago
Registration of Challenging Image Pairs: Initialization, Estimation, and Decision
—Our goal is an automated 2D-image-pair registration algorithm capable of aligning images taken of a wide variety of natural and man-made scenes as well as many medical images. T...
Gehua Yang, Charles V. Stewart, Michal Sofka, Chia...
SCN
2010
Springer
122views Communications» more  SCN 2010»
15 years 5 months ago
Recursive Lattice Reduction
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
Thomas Plantard, Willy Susilo
181
Voted
CVPR
1997
IEEE
16 years 8 months ago
Global Training of Document Processing Systems Using Graph Transformer Networks
We propose a new machine learning paradigm called Graph Transformer Networks that extends the applicability of gradient-based learning algorithms to systems composed of modules th...
Léon Bottou, Yoshua Bengio, Yann LeCun
CVPR
1999
IEEE
16 years 8 months ago
Critical Motions in Euclidean Structure from Motion
We investigate the motions that lead to ambiguous Euclidean scene reconstructions under several common calibration constraints, giving a complete description of such critical moti...
Fredrik Kahl, Bill Triggs