Sciweavers

561 search results - page 47 / 113
» Shortest-Path Kernels on Graphs
Sort
View
ICPR
2006
IEEE
15 years 10 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
Horst Bunke, Michel Neuhaus
ICIP
2008
IEEE
15 years 4 months ago
Breast contour detection with shape priors
Breast cancer conservative treatment (BCCT) is considered the gold standard of breast cancer treatment. However, aesthetic results are heterogeneous and difficult to evaluate in ...
Ricardo Sousa, Jaime S. Cardoso, Joaquim F. Pinto ...
SSDBM
2005
IEEE
131views Database» more  SSDBM 2005»
15 years 3 months ago
Searching for Related Objects in Relational Databases
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
Xiaoxin Yin, Jiawei Han, Jiong Yang
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 3 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
15 years 2 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao