Sciweavers

4131 search results - page 399 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
TON
2010
221views more  TON 2010»
15 years 25 days ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
FOCM
2011
188views more  FOCM 2011»
14 years 9 months ago
Compressive Wave Computation
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomp...
Laurent Demanet, Gabriel Peyré
PODC
2011
ACM
14 years 9 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
SIGMOD
2011
ACM
297views Database» more  SIGMOD 2011»
14 years 9 months ago
Apples and oranges: a comparison of RDF benchmarks and real RDF datasets
The widespread adoption of the Resource Description Framework (RDF) for the representation of both open web and enterprise data is the driving force behind the increasing research...
Songyun Duan, Anastasios Kementsietsidis, Kavitha ...
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 8 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu