Sciweavers

2127 search results - page 351 / 426
» Computing large matchings fast
Sort
View
171
Voted
TSP
2010
14 years 10 months ago
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...
Qing Ling, Zhi Tian
127
Voted
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 10 months ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal
158
Voted
NAR
2011
189views Computer Vision» more  NAR 2011»
14 years 6 months ago
EDULISS: a small-molecule database with data-mining and pharmacophore searching capabilities
We present the relational database EDULISS (EDinburgh University Ligand Selection System), which stores structural, physicochemical and pharmacophoric properties of small molecule...
Kun-Yi Hsin, Hugh P. Morgan, Steven R. Shave, Andr...
138
Voted
AAAI
2011
14 years 3 months ago
A Switching Planner for Combined Task and Observation Planning
From an automated planning perspective the problem of practical mobile robot control in realistic environments poses many important and contrary challenges. On the one hand, the p...
Moritz Göbelbecker, Charles Gretton, Richard ...
138
Voted
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
13 years 6 months ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001