Sciweavers

4798 search results - page 221 / 960
» A Time for Change
Sort
View
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
16 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
17 years 25 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
EVOW
2008
Springer
15 years 8 months ago
A Memory Enhanced Evolutionary Algorithm for Dynamic Scheduling Problems
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...
Gregory J. Barlow, Stephen F. Smith
ATMOS
2008
124views Optimization» more  ATMOS 2008»
15 years 8 months ago
Simultaneous Network Line Planning and Traffic Assignment
One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives o...
Karl Nachtigall, Karl Jerosch
NIPS
2004
15 years 8 months ago
Adaptive Discriminative Generative Model and Its Applications
This paper presents an adaptive discriminative generative model that generalizes the conventional Fisher Linear Discriminant algorithm and renders a proper probabilistic interpret...
Ruei-Sung Lin, David A. Ross, Jongwoo Lim, Ming-Hs...