Sciweavers

1327 search results - page 218 / 266
» Path following algorithm for the graph matching problem
Sort
View
IJON
2006
87views more  IJON 2006»
15 years 1 months ago
Translation-invariant classification of non-stationary signals
Non-stationary signal classification is a complex problem. This problem becomes even more difficult if we add the following hypothesis: each signal includes a discriminant wavefor...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
WEBI
2009
Springer
15 years 8 months ago
Rigorous Probabilistic Trust-Inference with Applications to Clustering
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
Thomas DuBois, Jennifer Golbeck, Aravind Srinivasa...
ICIP
2008
IEEE
15 years 8 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 ...
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 7 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 ...
AAAI
2007
15 years 4 months ago
Best-First Search for Treewidth
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
P. Alex Dow, Richard E. Korf