Sciweavers

620 search results - page 90 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
TSP
2010
14 years 6 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
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
13 years 2 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
SCALESPACE
2007
Springer
15 years 5 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré
INLG
2010
Springer
14 years 9 months ago
Charting the Potential of Description Logic for the Generation of Referring Expressions
The generation of referring expressions (GRE), an important subtask of Natural Language Generation (NLG) is to generate phrases that uniquely identify domain entities. Until recen...
Yuan Ren, Kees van Deemter, Jeff Z. Pan
FAST
2004
15 years 1 months ago
CAR: Clock with Adaptive Replacement
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the a...
Sorav Bansal, Dharmendra S. Modha