Sciweavers

3341 search results - page 512 / 669
» On Bounded Queries and Approximation
Sort
View
SEMWEB
2010
Springer
15 years 3 months ago
OWL-POLAR: Semantic Policies for Agent Reasoning
Abstract. Policies are declarations of constraints on the behaviour of components within distributed systems, and are often used to capture norms within agent-based systems. A few ...
Murat Sensoy, Timothy J. Norman, Wamberto Weber Va...
IEICET
2011
15 years 24 days ago
The Security of Abreast-DM in the Ideal Cipher Model
Abstract. In this paper, we give a security proof for Abreast-DM in terms of collision resistance and preimage resistance. As old as Tandem-DM, the compression function Abreast-DM ...
Jooyoung Lee, Daesung Kwon
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 8 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
149
Voted
ICIP
2004
IEEE
16 years 7 months ago
Feature statistical retrieval applied to content-based copy identification
In many image or video retrieval systems, the search of similar objects in the database includes a spatial access method to a multidimensional feature space. This step is generall...
Alexis Joly, Carl Frélicot, Olivier Buisson
SIGMOD
2005
ACM
220views Database» more  SIGMOD 2005»
16 years 6 months ago
Sampling Algorithms in a Stream Operator
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
Theodore Johnson, S. Muthukrishnan, Irina Rozenbau...