Sciweavers

474 search results - page 75 / 95
» On Multicast Path Finding Algorithms
Sort
View
ICPR
2006
IEEE
14 years 1 months ago
Optimal Global Mosaic Generation from Retinal Images
We present a method to construct a mosaic from multiple color and fluorescein retinal images. A set of images taken from different views at different times is difficult to registe...
Tae Eun Choe, Isaac Cohen, Mun Wai Lee, Gér...
IPPS
1998
IEEE
13 years 12 months ago
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
Shan-Chyun Ku, Biing-Feng Wang
DAM
2008
123views more  DAM 2008»
13 years 7 months ago
Polar cographs
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
Tinaz Ekim, Nadimpalli V. R. Mahadev, Dominique de...
ICCV
2007
IEEE
14 years 9 months ago
Locally-Constrained Region-Based Methods for DW-MRI Segmentation
In this paper, we describe a method for segmenting fiber bundles from diffusion-weighted magnetic resonance images using a locally-constrained region based approach. From a pre-co...
John Melonakos, Marc Niethammer, Vandana Mohan, Ma...
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 8 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen