Sciweavers

1403 search results - page 119 / 281
» About Approximations of Exponentials
Sort
View
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
14 years 4 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
ICDT
2009
ACM
166views Database» more  ICDT 2009»
16 years 5 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
ICIP
2003
IEEE
16 years 6 months ago
Graph-based object tracking
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
Cristina Gomila, Fernand Meyer
256
Voted
ICDE
2004
IEEE
144views Database» more  ICDE 2004»
16 years 6 months ago
Spatio-Temporal Aggregation Using Sketches
Several spatio-temporal applications require the retrieval of summarized information about moving objects that lie in a query region during a query interval (e.g., the number of m...
Yufei Tao, George Kollios, Jeffrey Considine, Feif...
234
Voted
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 4 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore