Sciweavers

1221 search results - page 125 / 245
» Balanced graph partitioning
Sort
View
WINE
2010
Springer
159views Economy» more  WINE 2010»
13 years 8 months ago
Local Dynamics in Bargaining Networks via Random-Turn Games
Abstract. We present a new technique for analyzing the rate of convergence of local dynamics in bargaining networks. The technique reduces balancing in a bargaining network to opti...
L. Elisa Celis, Nikhil R. Devanur, Yuval Peres
ICCAD
2003
IEEE
136views Hardware» more  ICCAD 2003»
14 years 7 months ago
Synthesis of Heterogeneous Distributed Architectures for Memory-Intensive Applications
— Memory-intensive applications present unique challenges to an ASIC designer in terms of the choice of memory organization, memory size requirements, bandwidth and access latenc...
Chao Huang, Srivaths Ravi, Anand Raghunathan, Nira...
ADC
2003
Springer
123views Database» more  ADC 2003»
14 years 3 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
IPPS
2007
IEEE
14 years 4 months ago
A Utility-based Approach to Cost-Aware Caching in Heterogeneous Storage Systems
Modern single and multi-processor computer systems incorporate, either directly or through a LAN, a number of storage devices with diverse performance characteristics. These stora...
Liton Chakraborty, Ajit Singh
VLDB
2004
ACM
134views Database» more  VLDB 2004»
14 years 3 months ago
A Privacy-Preserving Index for Range Queries
Database outsourcing is an emerging data management paradigm which has the potential to transform the IT operations of corporations. In this paper we address privacy threats in da...
Bijit Hore, Sharad Mehrotra, Gene Tsudik