Results 1 - 10 of 603

A Factorization Based Algorithm for Multi-Image Projective Structure and Motion

by Peter Sturm, Bill Triggs , 1996
"... . We propose a method for the recovery of projective shape and motion from multiple images of a scene by the factorization of a matrix containing the images of all points in all views. This factorization is only possible when the image points are correctly scaled. The major technical contribution of ..."
Abstract - Cited by 267 (15 self) - Add to MetaCart
Introduction In the last few years, the geometric and algebraic relations between uncalibrated views have found lively interest in the computer vision community. A first key result states that, from two uncalibrated views, one can recover the 3D structure of a scene up to an unknown projective transformation

Selectivity Estimation Without the Attribute Value Independence Assumption

by Viswanath Poosala , 1997
"... The result size of a query that involves multiple attributes from the same relation depends on these attributes’joinr data distribution, i.e., the frequencies of all combinations of attribute values. To simplify the estimation of that size, most commercial systems make the artribute value independen ..."
Abstract - Cited by 235 (12 self) - Add to MetaCart
The result size of a query that involves multiple attributes from the same relation depends on these attributes’joinr data distribution, i.e., the frequencies of all combinations of attribute values. To simplify the estimation of that size, most commercial systems make the artribute value

Cryptanalysis of block ciphers with overdefined systems of equations

by Nicolas T. Courtois, Josef Pieprzyk , 2002
"... Abstract. Several recently proposed ciphers, for example Rijndael and Serpent, are built with layers of small S-boxes interconnected by linear key-dependent layers. Their security relies on the fact, that the classical methods of cryptanalysis (e.g. linear or differential attacks) are based on proba ..."
Abstract - Cited by 253 (22 self) - Add to MetaCart
the sparsity of the equations and their specific structure. The XSL attack uses only relations true with probability 1, and thus the security does not have to grow exponentially in the number of rounds. XSL has a parameter P, and from our estimations is seems that P should be a constant or grow very slowly

NTRU: A Ring-Based Public Key Cryptosystem

by Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman - Lecture Notes in Computer Science , 1998
"... . We describe NTRU, a new public key cryptosystem. NTRU features reasonably short, easily created keys, high speed, and low memory requirements. NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability the ..."
Abstract - Cited by 205 (4 self) - Add to MetaCart
. We describe NTRU, a new public key cryptosystem. NTRU features reasonably short, easily created keys, high speed, and low memory requirements. NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability

Coil sensitivity encoding for fast MRI. In:

by Klaas P Pruessmann , Markus Weiger , Markus B Scheidegger , Peter Boesiger - Proceedings of the ISMRM 6th Annual Meeting, , 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract - Cited by 193 (3 self) - Add to MetaCart
and technical concerns, inherent limits of k-space speed have almost been reached. An entirely different approach to sub-wavelength resolution in MRI is based on the fact that with a receiver placed near the object the contribution of a signal source to the induced voltage varies appreciably with its relative

RankSQL: Query algebra and optimization for relational top-k queries

by Chengkai Li, Kevin Chen-chuan, Chang Ihab, F. Ilyas, Sumin Song - In SIGMOD , 2005
"... This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database systems (RDBMS), by extending relational algebra and query optimization. Previously, top-k query processing is studied in the ..."
Abstract - Cited by 110 (17 self) - Add to MetaCart
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database systems (RDBMS), by extending relational algebra and query optimization. Previously, top-k query processing is studied

TIMBER: A Native XML Database

by H. V. Jagadish, Shurug Al-Khalifa, Adriane Chapman, Laks V. S. Lakshmanan, Andrew Nierman, Stelios Paparizos, Jignesh M. Patel, Divesh Srivastava, Nuwee Wiwatwattana, Yuqing Wu, Cong Yu - THE VLDB JOURNAL , 2002
"... This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based upon a bulk algebra for manipulating trees, and natively stores XML. New access methods have been developed to evaluate queries in ..."
Abstract - Cited by 142 (14 self) - Add to MetaCart
native XML store, with all the standard components of relational query processing, including algebraic rewriting and a cost-based optimizer.

Lie-Algebraic Averaging For Globally Consistent Motion Estimation

by Venu Madhav Govindu , 2004
"... While motion estimation has been extensively studied in the computer vision literature, the inherent information redundancy in an image sequence has not been well utilised. In particular as many as pairwise relative motions can be estimated efficiently from a sequence of N images. This highly red ..."
Abstract - Cited by 68 (3 self) - Add to MetaCart
While motion estimation has been extensively studied in the computer vision literature, the inherent information redundancy in an image sequence has not been well utilised. In particular as many as pairwise relative motions can be estimated efficiently from a sequence of N images. This highly

Statistical profile estimation in database systems

by V. Mannino - ACM Comput. Surveys , 1988
"... A statistical profile summarizes the instances of a database. It describes aspects such as the number of tuples, the number of values, the distribution of values, the correlation between value sets, and the distribution of tuples among secondary storage units. Estimation of database profiles is crit ..."
Abstract - Cited by 88 (0 self) - Add to MetaCart
in the model include build profile, estimate profile, and update profile. The estimate operator is classified by the relational algebra operator (select, project, join), the property to be estimated (cardinality, distribution of values, and other parameters), and the underlying method (parametric

On Estimators for Aggregate Relational Algebra Queries

by n.n. , 1995
"... CASE-DB is a relational database management system that allows users to specify time constraints in queries. For an aggregate query AGG(E) where AGG is one of COUNT, SUM and AVERAGE, and E is a relational algebra expression, CASE-DB uses statistical estimators to approximate the query. This paper ex ..."
Abstract - Add to MetaCart
CASE-DB is a relational database management system that allows users to specify time constraints in queries. For an aggregate query AGG(E) where AGG is one of COUNT, SUM and AVERAGE, and E is a relational algebra expression, CASE-DB uses statistical estimators to approximate the query. This paper
Results 1 - 10 of 603