Sciweavers

356 search results - page 60 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
GLOBECOM
2009
IEEE
14 years 2 months ago
Data Acquisition through Joint Compressive Sensing and Principal Component Analysis
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
Riccardo Masiero, Giorgio Quer, Daniele Munaretto,...
JCO
2006
126views more  JCO 2006»
13 years 7 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 1 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed
CCR
2000
113views more  CCR 2000»
13 years 7 months ago
TCP rate control
TCP congestion control 9] is designed for network stability, robustness and opportunistic use of network bu er and bandwidth resources on an end-to-end per-connection basis. Upon ...
Shrikrishna Karandikar, Shivkumar Kalyanaraman, Pr...
SPIN
2009
Springer
14 years 2 months ago
Fast, All-Purpose State Storage
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
Peter C. Dillinger, Panagiotis Manolios