Sciweavers

1672 search results - page 91 / 335
» Tightness problems in the plane
Sort
View
IJCAI
2001
13 years 10 months ago
Adaptive Control of Acyclic Progressive Processing Task Structures
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
Stéphane Cardon, Abdel-Illah Mouaddib, Shlo...
CVIU
2008
229views more  CVIU 2008»
13 years 9 months ago
Estimating pedestrian counts in groups
The goal of this work is to provide a system which can aid in monitoring crowded urban environments, which often contain tight groups of people. In this paper, we consider the pro...
Prahlad Kilambi, Evan Ribnick, Ajay J. Joshi, Osam...
JCSS
2008
96views more  JCSS 2008»
13 years 9 months ago
A combinatorial characterization of resolution width
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
Albert Atserias, Víctor Dalmau
JCSS
2008
80views more  JCSS 2008»
13 years 9 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
JCO
2010
70views more  JCO 2010»
13 years 7 months ago
Worst-case analysis for on-line service policies
This paper considers an on-line scheduling problem occurred in a service system with two classes (normal and special) of customers and two types (dedicated and flexible) of serve...
Zhenbo Wang, Wenxun Xing