Sciweavers

32 search results - page 5 / 7
» Maintaining a large matching and a small vertex cover
Sort
View
TMI
2002
248views more  TMI 2002»
13 years 7 months ago
Adaptive Elastic Segmentation of Brain MRI via Shape Model Guided Evolutionary Programming
This paper presents a fully automated segmentation method for medical images. The goal is to localize and parameterize a variety of types of structure in these images for subsequen...
Alain Pitiot, Arthur W. Toga, Paul M. Thompson
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
CIKM
1998
Springer
13 years 11 months ago
Supporting Fast Search in Time Series for Movement Patterns in Multiple Scales
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...
Yunyao Qu, Changzhou Wang, Xiaoyang Sean Wang
INFOCOM
2008
IEEE
14 years 1 months ago
The Inframetric Model for the Internet
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...
CVPR
2007
IEEE
14 years 9 months ago
Shape Representation and Registration using Vector Distance Functions
This paper introduces a new method for shape registration by matching vector distance functions. The vector distance function representation is more flexible than the conventional...
Hossam E. Abd El Munim, Aly A. Farag