Sciweavers

349 search results - page 37 / 70
» The Finite and the Infinite
Sort
View
PODS
2004
ACM
158views Database» more  PODS 2004»
14 years 10 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
ICDT
2007
ACM
74views Database» more  ICDT 2007»
14 years 1 months ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu
DCC
2004
IEEE
14 years 9 months ago
Towards a Uniform Description of Several Group Based Cryptographic Primitives
The public key cryptosystems MST1 and MST2 make use of certain kinds of factorizations of finite groups. We show that generalizing such factorizations to infinite groups allows a ...
Maria Isabel Gonzalez Vasco, Consuelo Martínez, R...
ISCAS
2003
IEEE
107views Hardware» more  ISCAS 2003»
14 years 3 months ago
Synthesis of a pulse-forming reactance network to shape a delayed quasi-rectangular pulse
—The paper describes synthesis of a reactance network shaping a delayed quasi-rectangular pulse when the input step voltage is applied. The derivative of the step response is app...
Igor M. Filanovsky, P. N. Matkhanov
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
14 years 11 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas