Sciweavers

265 search results - page 49 / 53
» Not Everything We Know We Learned
Sort
View
WWW
2006
ACM
15 years 10 months ago
Automatic identification of user interest for personalized search
One hundred users, one hundred needs. As more and more topics are being discussed on the web and our vocabulary remains relatively stable, it is increasingly difficult to let the ...
Feng Qiu, Junghoo Cho
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
ANLP
1994
155views more  ANLP 1994»
14 years 11 months ago
Guided Sentences Composition for Disabled People
We present the advantages of guided sentences composition for communicating in natural language with computers. We show how guidance can be achieved by means of the partial synthe...
Robert Pasero, Nathalie Richardet, Paul Sabatier
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
15 years 3 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
SIGCOMM
2009
ACM
15 years 4 months ago
Economic issues in shared infrastructures
We define some interesting incentive issues that arise in the management of virtual infrastructures. We demonstrate that participants’ decisions about the quantities of infrast...
Costas Courcoubetis, Richard R. Weber