Sciweavers

459 search results - page 71 / 92
» Random sampling from a search engine's index
Sort
View
MMSEC
2006
ACM
132views Multimedia» more  MMSEC 2006»
14 years 2 months ago
On achievable security levels for lattice data hiding in the known message attack scenario
This paper presents a theoretical security analysis of lattice data hiding. The security depends on the secrecy of a dither signal that randomizes the codebook. If the same secret...
Luis Pérez-Freire, Fernando Pérez-Go...
COMAD
2008
13 years 10 months ago
Exploiting Asynchronous IO using the Asynchronous Iterator Model
Asynchronous IO (AIO) allows a process to continue to do other work while an IO operation initiated earlier completes. AIO allows a large number of random IO operations to be issu...
Suresh Iyengar, S. Sudarshan, Santosh Kumar 0002, ...
DICTA
2003
13 years 9 months ago
A Robust Method for Estimating the Fundamental Matrix
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...
C. L. Feng, Y. S. Hung
NIPS
2003
13 years 9 months ago
Ranking on Data Manifolds
The Google search engine has enjoyed huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks....
Dengyong Zhou, Jason Weston, Arthur Gretton, Olivi...
SIGMOD
2004
ACM
153views Database» more  SIGMOD 2004»
14 years 1 months ago
Spatially-decaying aggregation over a network: model and algorithms
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...
Edith Cohen, Haim Kaplan