Sciweavers

2314 search results - page 273 / 463
» Minimal Partitions of a Graph
Sort
View
ICPR
2008
IEEE
16 years 5 months ago
HOPS: Efficient region labeling using Higher Order Proxy Neighborhoods
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
Albert Y. C. Chen, Jason J. Corso, Le Wang
MICCAI
2009
Springer
15 years 8 months ago
Bayesian Maximal Paths for Coronary Artery Segmentation from 3D CT Angiograms
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an eï¬...
David Lesage, Elsa D. Angelini, Isabelle Bloch, Ga...
ESA
2006
Springer
126views Algorithms» more  ESA 2006»
15 years 8 months ago
Cooperative TSP
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...
Amitai Armon, Adi Avidor, Oded Schwartz
PSB
2004
15 years 5 months ago
Multiplexing Schemes for Generic SNP Genotyping Assays
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
Roded Sharan, Amir Ben-Dor, Zohar Yakhini
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 4 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin