Sciweavers

Share
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
7 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...
CORR
2012
Springer
228views Education» more  CORR 2012»
8 years 2 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
AAAI
2011
8 years 7 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev
FOCS
2010
IEEE
9 years 4 months ago
Distance Oracles beyond the Thorup-Zwick Bound
We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our dista...
Mihai Patrascu, Liam Roditty
BMVC
2010
9 years 5 months ago
Classifying Textile Designs using Region Graphs
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
Wei Jia, Stephen J. McKenna, Annette A. Ward, Keit...
ESA
2005
Springer
98views Algorithms» more  ESA 2005»
10 years 14 days ago
Small Stretch Spanners on Dynamic Graphs
We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3or 5-spanner...
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe...
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
10 years 1 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
10 years 1 months ago
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs
How do real, weighted graphs change over time? What patterns, if any, do they obey? Earlier studies focus on unweighted graphs, and, with few exceptions, they focus on static snap...
Leman Akoglu, Mary McGlohon, Christos Faloutsos
books