Sciweavers

64 search results - page 6 / 13
» REHIST: Relative Error Histogram Construction Algorithms
Sort
View
IACR
2011
115views more  IACR 2011»
12 years 6 months ago
Pseudorandom Functions and Lattices
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
Abhishek Banerjee, Chris Peikert, Alon Rosen
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 8 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
TCSV
2008
134views more  TCSV 2008»
13 years 6 months ago
Invariant Image Watermarking Based on Statistical Features in the Low-Frequency Domain
Watermark resistance to geometric attacks is an important issue in the image watermarking community. Most countermeasures proposed in the literature usually focus on the problem of...
Shijun Xiang, Hyoung-Joong Kim, Jiwu Huang
IMAGING
2003
13 years 8 months ago
Using Colour to Model Outliers
Computer vision applications are able to model and reconstruct three dimensional scenes from several pictures. In this work, we are interested in the group of algorithm that regis...
David Hasler, Sabine Süsstrunk
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
13 years 11 months ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan