Sciweavers

74 search results - page 13 / 15
» On edge orienting methods for graph coloring
Sort
View
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 3 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
CVPR
2009
IEEE
4141views Computer Vision» more  CVPR 2009»
15 years 1 months ago
Vanishing point detection for road detection
Given a single image of an arbitrary road, that may not be well-paved, or have clearly delineated edges, or some a priori known color or texture distribution, is it possible for...
Hui Kong, Jean Ponce, Jean-Yves Audibert
CVPR
2009
IEEE
15 years 10 days ago
A Graph-based Approach to Skin Mole Matching Incorporating Template-Normalized Coordinates
Density of moles is a strong predictor of malignant melanoma. Some dermatologists advocate periodic fullbody scan for high-risk patients. In current practice, physicians compare...
Ghassan Hamarneh, Hengameh Mirzaalian, Tim K. Lee
GLOBECOM
2007
IEEE
14 years 11 days ago
Loss Tomography in General Topologies with Network Coding
Abstract— Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general...
Minas Gjoka, Christina Fragouli, Pegah Sattari, At...
SIAMIS
2011
12 years 8 months ago
Level Set Based Multispectral Segmentation with Corners
In this paper we propose an active contour model for segmentation based on the Chan-Vese model. The new model can capture inherent sharp features, i.e., the sharp corners of object...
Wenhua Gao, Andrea L. Bertozzi