Sciweavers

112 search results - page 20 / 23
» Improved algorithms for hypergraph bipartitioning
Sort
View
ICDCS
2009
IEEE
14 years 3 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
SOCIALCOM
2010
13 years 4 months ago
On the Navigability of Social Tagging Systems
It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number ...
Denis Helic, Christoph Trattner, Markus Strohmaier...
INFOCOM
2011
IEEE
12 years 10 months ago
Network-aware behavior clustering of Internet end hosts
Abstract—This paper explores the behavior similarity of Internet end hosts in the same network prefixes. We use bipartite graphs to model network traffic, and then construct on...
Kuai Xu, Feng Wang 0002, Lin Gu
DAC
2006
ACM
14 years 7 months ago
Novel full-chip gridless routing considering double-via insertion
As the technology node advances into the nanometer era, via-open defects are one of the dominant failures. To improve via yield and reliability, redundant-via insertion is a highl...
Huang-Yu Chen, Mei-Fang Chiang, Yao-Wen Chang, Lum...
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
11 years 9 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...