Sciweavers

1425 search results - page 250 / 285
» Beyond Dependency Graphs
Sort
View
CAL
2006
13 years 8 months ago
A Case for Compressing Traces with BDDs
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
Graham D. Price, Manish Vachharajani
CORR
2007
Springer
96views Education» more  CORR 2007»
13 years 8 months ago
Understanding the Properties of the BitTorrent Overlay
—In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the ...
Anwar Al Hamra, Arnaud Legout, Chadi Barakat
CORR
2007
Springer
91views Education» more  CORR 2007»
13 years 8 months ago
Single-Exclusion Number and the Stopping Redundancy of MDS Codes
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
Junsheng Han, Paul H. Siegel, Ron M. Roth
ORDER
2008
61views more  ORDER 2008»
13 years 8 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel
PERVASIVE
2008
Springer
13 years 8 months ago
A fair and energy-efficient topology control protocol for wireless sensor networks
In energy constrained wireless sensor networks, energy conservation techniques are to be applied in order to maximize the system lifetime. We tackle the problem of increasing netw...
Rami Mochaourab, Waltenegus Dargie