Sciweavers

2254 search results - page 431 / 451
» Computing the minimal covering set
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 1 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
NSDI
2008
14 years 6 days ago
UsenetDHT: A Low-Overhead Design for Usenet
Usenet is a popular distributed messaging and file sharing service: servers in Usenet flood articles over an overlay network to fully replicate articles across all servers. Howeve...
Emil Sit, Robert Morris, M. Frans Kaashoek
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 12 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
CHI
2008
ACM
13 years 12 months ago
Implicit user-adaptive system engagement in speech and pen interfaces
As emphasis is placed on developing mobile, educational, and other applications that minimize cognitive load on users, it is becoming more essential to base interface design on im...
Sharon L. Oviatt, Colin Swindells, Alexander M. Ar...
NIPS
2003
13 years 11 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand