Sciweavers

312 search results - page 58 / 63
» Iterative compression and exact algorithms
Sort
View
WWW
2005
ACM
14 years 10 months ago
PageRank as a function of the damping factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
ATAL
2009
Springer
14 years 4 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
JSAC
2006
105views more  JSAC 2006»
13 years 9 months ago
Network Topology Inference Based on End-to-End Measurements
Abstract--We consider using traceroute-like end-to-end measurement to infer the underlay topology for a group of hosts. One major issue is the measurement cost. Given hosts in an a...
Xing Jin, Wai-Pun Ken Yiu, S.-H. Gary Chan, Yajun ...
TSP
2008
151views more  TSP 2008»
13 years 9 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
14 years 10 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu