Sciweavers

380 search results - page 46 / 76
» Cluster Graphs as Abstractions for Constraint Satisfaction P...
Sort
View
FOCS
2000
IEEE
14 years 8 days ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
CP
2003
Springer
14 years 1 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
ECCV
2006
Springer
14 years 10 months ago
A Multiview Approach to Tracking People in Crowded Scenes Using a Planar Homography Constraint
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
Saad M. Khan, Mubarak Shah
WG
1994
Springer
14 years 22 days ago
Fugitive-Search Games on Graphs and Related Parameters
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M...
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 9 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...