Sciweavers

385 search results - page 37 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
HIPC
2009
Springer
13 years 8 months ago
Automatic data placement and replication in grids
Data grids provide geographically distributed storage and computing resources for large data-intensive applications. To support fast data access and processing, effective data man...
Ying Ding, Ying Lu
UAI
2000
13 years 11 months ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
ICCD
2007
IEEE
121views Hardware» more  ICCD 2007»
14 years 7 months ago
Fast power network analysis with multiple clock domains
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
Wanping Zhang, Ling Zhang, Rui Shi, He Peng, Zhi Z...
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
12 years 19 days ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
14 years 3 months ago
Rounding of Sequences and Matrices, with Applications
Abstract. We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all ...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...