Sciweavers

724 search results - page 6 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
BTW
2007
Springer
142views Database» more  BTW 2007»
15 years 5 months ago
Getting Prime Cuts from Skylines over Partially Ordered Domains
: Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numeric...
Wolf-Tilo Balke, Wolf Siberski, Ulrich Güntze...
IOR
2006
173views more  IOR 2006»
14 years 11 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
INFOCOM
2008
IEEE
15 years 6 months ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose
CVPR
2009
IEEE
16 years 6 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
ICCV
2009
IEEE
1035views Computer Vision» more  ICCV 2009»
16 years 4 months ago
Efficient High-Quality Image Contour Detection
Image contour detection is fundamental to many image analysis applications, including image segmentation, object recognition and classification. However, highly accurate image c...
Bryan Catanzaro, Bor-Yiing Su, Narayanan Sundaram,...