Sciweavers

966 search results - page 51 / 194
» Small Alliances in Graphs
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Skeletal graphs for efficient structure from motion
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
Noah Snavely, Steven M. Seitz, Richard Szeliski
ICCV
2007
IEEE
14 years 10 months ago
Graph-Cut Transducers for Relevance Feedback in Content Based Image Retrieval
Closing the semantic gap in content based image retrieval (CBIR) basically requires the knowledge of the user's intention which is usually translated into a sequence of quest...
Hichem Sahbi, Jean-Yves Audibert, Renaud Keriven
ICPR
2004
IEEE
14 years 9 months ago
Outlier Detection Using k-Nearest Neighbour Graph
We present an Outlier Detection using Indegree Number (ODIN) algorithm that utilizes k-nearest neighbour graph. Improvements to existing kNN distance -based method are also propos...
Ismo Kärkkäinen, Pasi Fränti, Ville...
GD
2003
Springer
14 years 1 months ago
An Energy Model for Visual Graph Clustering
We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes ...
Andreas Noack
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
14 years 1 months ago
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
Aleksander Madry