Sciweavers

2226 search results - page 416 / 446
» Computable Analysis via Representations
Sort
View
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 2 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
ICALP
2009
Springer
16 years 2 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
MSWIM
2009
ACM
15 years 8 months ago
On providing location privacy for mobile sinks in wireless sensor networks
Wireless sensor networks have attracted increasing attentions considering their potentials for being widely adopted in both emerging civil and military applications. A common prac...
Edith C.-H. Ngai, Ioana Rodhe
ICCCN
2008
IEEE
15 years 8 months ago
TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs
—The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK — a no...
Avinash Srinivasan, Jie Wu
ICRA
2008
IEEE
167views Robotics» more  ICRA 2008»
15 years 8 months ago
An approximate algorithm for solving oracular POMDPs
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
Nicholas Armstrong-Crews, Manuela M. Veloso