Sciweavers

942 search results - page 70 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
ECCV
2010
Springer
14 years 3 months ago
Reweighted Random Walks for Graph Matching
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
Minsu Cho (Seoul National University), Jungmin Lee...
TON
2008
119views more  TON 2008»
13 years 9 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
SMA
2009
ACM
219views Solid Modeling» more  SMA 2009»
14 years 4 months ago
Log-aesthetic space curve segments
For designing aesthetic surfaces, such as the car bodies, it is very important to use aesthetic curves as characteristic lines. In such curves, the curvature should be monotonical...
Norimasa Yoshida, Ryo Fukuda, Takafumi Saito
CVIU
2006
105views more  CVIU 2006»
13 years 10 months ago
The representation and matching of categorical shape
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
Ali Shokoufandeh, Lars Bretzner, Diego Macrini, M....
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti