Sciweavers

384 search results - page 45 / 77
» The Number of Generalized Balanced Lines
Sort
View
ICDE
2002
IEEE
116views Database» more  ICDE 2002»
15 years 6 days ago
SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks
Scalable storage architectures allow for the addition of disks to increase storage capacity and/or bandwidth. In its general form, disk scaling also refers to disk removals when e...
Ashish Goel, Cyrus Shahabi, Shu-Yuen Didi Yao, Rog...
WWW
2006
ACM
14 years 11 months ago
Dynamic placement for clustered web applications
We introduce and evaluate a middleware clustering technology capable of allocating resources to web applications through dynamic application instance placement. We define applicat...
A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike S...
SIGMOD
2008
ACM
126views Database» more  SIGMOD 2008»
14 years 11 months ago
On efficient top-k query processing in highly distributed environments
Lately the advances in centralized database management systems show a trend towards supporting rank-aware query operators, like top-k, that enable users to retrieve only the most ...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
CODES
2009
IEEE
14 years 5 months ago
On compile-time evaluation of process partitioning transformations for Kahn process networks
Kahn Process Networks is an appealing model of computation for programming and mapping applications onto multi-processor platforms. Autonomous processes communicate through unboun...
Sjoerd Meijer, Hristo Nikolov, Todor Stefanov
INFOCOM
2009
IEEE
14 years 5 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...