Sciweavers

398 search results - page 16 / 80
» Critical exponents of graphs
Sort
View
ICALP
2004
Springer
14 years 3 months ago
A Faster Algorithm for Minimum Cycle Basis of Graphs
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
CSE
2009
IEEE
14 years 2 months ago
Gaming On and Off the Social Graph: The Social Structure of Facebook Games
—Games built on Online Social Networks (OSNs) have become a phenomenon since 3rd party developer tools were exposed by OSNs such as Facebook. However, apart from their explosive ...
Ben Kirman, Shaun Lawson, Conor Linehan
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
JMLR
2006
124views more  JMLR 2006»
13 years 9 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
WAW
2007
Springer
85views Algorithms» more  WAW 2007»
14 years 3 months ago
A Spatial Web Graph Model with Local Influence Regions
We present a new stochastic model for complex networks, based on a spatial embedding of the nodes, called the Spatial Preferred Attachment (SPA) model. In the SPA model, nodes have...
William Aiello, Anthony Bonato, C. Cooper, Jeannet...