Sciweavers

3267 search results - page 393 / 654
» Generalized quasirandom graphs
Sort
View
AIRWEB
2009
Springer
16 years 1 months ago
Tag spam creates large non-giant connected components
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
Nicolas Neubauer, Robert Wetzker, Klaus Obermayer
CIKM
2009
Springer
16 years 1 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
EMMCVPR
2009
Springer
16 years 1 months ago
Multi-label Moves for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
Olga Veksler
INFOCOM
2007
IEEE
16 years 29 days ago
Lexicographic Fairness in WDM Optical Cross-Connects
— We consider fair allocation of sessions at the outputs of optical cross-connects employing wavelength division multiplexing (WDM). Each session consists of traffic on one or m...
Satya Ranjan Mohanty, Laxmi N. Bhuyan
GRAPHITE
2005
ACM
16 years 7 days ago
Uniting cartoon textures with computer assisted animation
We present a novel method to create perpetual animations from a small set of given keyframes. Existing approaches either are limited to re-sequencing large amounts of existing ima...
William Van Haevre, Fabian Di Fiore, Frank Van Ree...