Sciweavers

1404 search results - page 57 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ECCV
2002
Springer
15 years 11 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
ATAL
2011
Springer
13 years 9 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...
ICRA
2000
IEEE
88views Robotics» more  ICRA 2000»
15 years 2 months ago
Incremental Optimization of Cyclic Timed Event Graphs
In this paper we deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delay...
Alessandro Giua, Aldo Piccaluga, Carla Seatzu
HPCC
2005
Springer
15 years 3 months ago
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
Doruk Bozdag, Ümit V. Çatalyürek,...
IPPS
1997
IEEE
15 years 1 months ago
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...