Sciweavers

510 search results - page 45 / 102
» How Should We Solve Search Problems Privately
Sort
View
TASE
2010
IEEE
13 years 3 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
EELC
2006
121views Languages» more  EELC 2006»
14 years 13 days ago
Symbol Grounding Through Cumulative Learning
Abstract. We suggest that the primary motivation for an agent to construct a symbol-meaning mapping is to solve a task. The meaning space of an agent should be derived from the tas...
Samarth Swarup, Kiran Lakkaraju, Sylvian R. Ray, L...
ASIACRYPT
2010
Springer
13 years 6 months ago
Structured Encryption and Controlled Disclosure
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
Melissa Chase, Seny Kamara
NDSS
2002
IEEE
14 years 1 months ago
Advanced Client/Server Authentication in TLS
Many business transactions on the Internet occur between strangers, that is, between entities with no prior relationship and no common security domain. Traditional security approa...
Adam Hess, Jared Jacobson, Hyrum Mills, Ryan Wamsl...
AICT
2006
IEEE
122views Communications» more  AICT 2006»
14 years 2 months ago
Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems
A peer-to-peer file sharing system includes a lookup and a content distribution protocol. Very efficient peer-to-peer protocols exist for content distribution, but efficient in...
Anh-Tuan Gai, Laurent Viennot