1518 search results - page 99 / 304 » Exact and Approximate Bandwidth |
131
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
168
click to vote
IS
2006
15 years 4 months ago
2006
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
140
click to vote
JACM
2000
15 years 4 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
227
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
134
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...