Sciweavers

9572 search results - page 397 / 1915
» Cover Algorithms and Their Combination
Sort
View
LPAR
2005
Springer
16 years 9 days ago
Concepts of Automata Construction from LTL
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...
Carsten Fritz
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
16 years 6 days ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 5 months ago
RoboCast: Asynchronous Communication in Robot Networks
Abstract. This paper introduces the RoboCast communication abstraction. The RoboCast allows a swarm of non oblivious, anonymous robots that are only endowed with visibility sensors...
Zohir Bouzid, Shlomi Dolev, Maria Potop-Butucaru, ...
CVPR
2012
IEEE
13 years 9 months ago
Changedetection.net: A new change detection benchmark dataset
Change detection is one of the most commonly encountered low-level tasks in computer vision and video processing. A plethora of algorithms have been developed to date, yet no wide...
Nil Goyette, Pierre-Marc Jodoin, Fatih Porikli, Ja...
TIP
2008
79views more  TIP 2008»
15 years 6 months ago
An Overview and Performance Evaluation of Classification-Based Least Squares Trained Filters
An overview of the classification-based least squares trained filters on picture quality improvement algorithms is presented. For each algorithm, the training process is unique and...
Ling Shao, Hui Zhang, Gerard de Haan