1161 search results - page 197 / 233 » Kinetic Dependence Graphs |
103
Voted
CAL
2006
15 years 15 days ago
2006
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...
CORR
2007
Springer
15 years 13 days ago
2007
Springer
—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 ...
107
Voted
CORR
2007
Springer
15 years 13 days ago
2007
Springer
—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...
115
click to vote
ORDER
2008
15 years 12 days ago
2008
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...
133
Voted
PERVASIVE
2008
Springer
15 years 12 days ago
2008
Springer
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...