Sciweavers

1578 search results - page 252 / 316
» Algorithmic randomness of continuous functions
Sort
View
TIT
2010
128views Education» more  TIT 2010»
13 years 3 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
WWW
2005
ACM
14 years 9 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 2 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
BMCBI
2008
153views more  BMCBI 2008»
13 years 8 months ago
Estimating the size of the solution space of metabolic networks
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
Alfredo Braunstein, Roberto Mulet, Andrea Pagnani
TON
2010
99views more  TON 2010»
13 years 3 months ago
Rate Control With Pairwise Intersession Network Coding
In this paper, we develop a distributed rate-control algorithm for networks with multiple unicast sessions when network coding is allowed across different sessions. Building on rec...
Abdallah Khreishah, Chih-Chun Wang, Ness B. Shroff