Sciweavers

906 search results - page 78 / 182
» Matching Subsequences in Trees
Sort
View
FOCS
1989
IEEE
14 years 1 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
MICCAI
2008
Springer
14 years 10 months ago
Markov Dependence Tree-Based Segmentation of Deep Brain Structures
We propose a new framework for multi-object segmentation of deep brain structures, which have significant shape variations and relatively small sizes in medical brain images. In th...
Jue Wu, Albert C. S. Chung
ICPR
2000
IEEE
14 years 10 months ago
Attributed Tree Homomorphism Using Association Graphs
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi,...
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
13 years 11 months ago
Computation Tree Regular Logic for Genetic Regulatory Networks
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
Radu Mateescu, Pedro T. Monteiro, Estelle Dumas, H...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 11 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos