Sciweavers

4698 search results - page 232 / 940
» Making Functionality More General
Sort
View
VLDB
1997
ACM
141views Database» more  VLDB 1997»
15 years 8 months ago
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
Thomas Seidl, Hans-Peter Kriegel
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 4 months ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
ECCC
2006
218views more  ECCC 2006»
15 years 4 months ago
Efficient Algorithms for Online Game Playing and Universal Portfolio Management
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
Amit Agarwal, Elad Hazan
IACR
2011
88views more  IACR 2011»
14 years 3 months ago
Targeted Malleability: Homomorphic Encryption for Restricted Computations
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
Dan Boneh, Gil Segev, Brent Waters
SIGIR
2003
ACM
15 years 9 months ago
Re-examining the potential effectiveness of interactive query expansion
Much attention has been paid to the relative effectiveness of interactive query expansion versus automatic query expansion. Although interactive query expansion has the potential ...
Ian Ruthven