Sciweavers

720 search results - page 133 / 144
» Nonrepetitive colorings of graphs
Sort
View
AICT
2006
IEEE
14 years 1 months ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
ICMCS
2005
IEEE
153views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Improved semantic region labeling based on scene context
Semantic region labeling in outdoor scenes, e.g., identifying sky, grass, foliage, water, and snow, facilitates content-based image retrieval, organization, and enhancement. A maj...
Matthew R. Boutell, Jiebo Luo, Christopher M. Brow...
PCM
2005
Springer
122views Multimedia» more  PCM 2005»
14 years 29 days ago
A Scheme for Ball Detection and Tracking in Broadcast Soccer Video
In this paper we propose a scheme for ball detection and tracking in broadcast soccer video. There are two alternate procedures in the scheme: ball detection and ball tracking. In ...
Dawei Liang, Yang Liu, Qingming Huang, Wen Gao
SAT
2005
Springer
133views Hardware» more  SAT 2005»
14 years 29 days ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 25 days ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao