Sciweavers

2294 search results - page 454 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
JSAC
2007
97views more  JSAC 2007»
13 years 8 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li
FAST
2009
13 years 6 months ago
HYDRAstor: A Scalable Secondary Storage
HYDRAstor is a scalable, secondary storage solution aimed at the enterprise market. The system consists of a back-end architectured as a grid of storage nodes built around a distr...
Cezary Dubnicki, Leszek Gryz, Lukasz Heldt, Michal...
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 9 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
14 years 9 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
14 years 9 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang