2570 search results - page 290 / 514 » Fast Algorithms For The Computation Of Ranklets |
226
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...
187
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
— 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...
188
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
212
click to vote
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. This paper investigates the challenges involve in designing a dynamic channel assignment (DCA) scheme for wireless mesh networks, particularly for multi-radio systems. It...
177
click to vote
ACL
2010
15 years 4 months ago
2010
This paper proposes a convolution forest kernel to effectively explore rich structured features embedded in a packed parse forest. As opposed to the convolution tree kernel, the p...