Sciweavers

886 search results - page 140 / 178
» On the Autoreducibility of Random Sequences
Sort
View
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
16 years 2 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
146
Voted
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
16 years 2 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
CHI
2010
ACM
16 years 12 days ago
The secure haptic keypad: a tactile password system
Authentication in public spaces poses significant security risks. Most significantly, passwords can be stolen, potentially leading to fraud. A common method to steal a PIN is thro...
Andrea Bianchi, Ian Oakley, Dong Soo Kwon
ICASSP
2009
IEEE
16 years 9 days ago
A mixed time-scale algorithm for distributed parameter estimation : Nonlinear observation models and imperfect communication
Abstract— The paper considers the algorithm NLU for distributed (vector) parameter estimation in sensor networks, where, the local observation models are nonlinear, and inter-sen...
Soummya Kar, José M. F. Moura
ICRA
2009
IEEE
170views Robotics» more  ICRA 2009»
16 years 6 days ago
Path diversity is only part of the problem
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
Ross A. Knepper, Matthew T. Mason