Sciweavers

188 search results - page 30 / 38
» A new meta-method for graph partitioning
Sort
View
ICCV
2001
IEEE
14 years 9 months ago
Image Segmentation with Minimum Mean Cut
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
Song Wang, Jeffrey Mark Siskind
VRML
1998
ACM
14 years 4 days ago
Simplicial Maps for Progressive Transmission of Polygonal Surfaces
We present a new method for (1) automatically generating multiple Levels Of Detail (LODs) of a polygonal surface, (2) progressively loading, or transmitting, and displaying a surf...
André Guéziec, Gabriel Taubin, Franc...
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 5 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor
HICSS
2008
IEEE
114views Biometrics» more  HICSS 2008»
14 years 2 months ago
On Structural Analysis of Large Networks
Containing much valuable information, networks such as the World Wide Web, social networks and metabolic networks draw increasingly attention in scientific communities. Network cl...
Nurcan Yuruk, Xiaowei Xu, Thomas A. J. Schweiger
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 2 months ago
Finding Branch-Decompositions and Rank-Decompositions
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Petr Hlinený, Sang-il Oum