Sciweavers

5169 search results - page 26 / 1034
» Locality approximation using time
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
173
Voted
CCCG
2010
15 years 7 months ago
Fast local searches and updates in bounded universes
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
138
Voted
3DPVT
2004
IEEE
15 years 10 months ago
Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps
Experimental structure analysis of biological molecules (e.g, proteins) or macromolecular complexes (e.g, viruses) can be used to generate three-dimensional density maps of these e...
Stefan Burkhardt, Kimmo Fredriksson, Tuomas Ojamie...
INFOCOM
2012
IEEE
13 years 8 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
JMLR
2010
119views more  JMLR 2010»
15 years 1 months ago
A Convergent Online Single Time Scale Actor Critic Algorithm
Actor-Critic based approaches were among the first to address reinforcement learning in a general setting. Recently, these algorithms have gained renewed interest due to their gen...
Dotan Di Castro, Ron Meir