Sciweavers

4378 search results - page 31 / 876
» On the Complexity of Ordered Colourings
Sort
View
IWINAC
2009
Springer
14 years 3 months ago
Optimised Particle Filter Approaches to Object Tracking in Video Sequences
In this paper, the ways of optimising a Particle Filter video tracking algorithm are investigated. The optimisation scheme discussed in this work is based on hybridising a Particle...
Artur Loza, Fanglin Wang, Miguel A. Patricio, Jes&...
JC
2007
130views more  JC 2007»
13 years 8 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
LOGCOM
2007
92views more  LOGCOM 2007»
13 years 8 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
ICCV
2009
IEEE
3166views Computer Vision» more  ICCV 2009»
15 years 16 days ago
Detection and Removal of Chromatic Moving Shadows in Surveillance Scenarios
Segmentation in the surveillance domain has to deal with shadows to avoid distortions when detecting moving objects. Most segmentation approaches dealing with shadow detection are ...
Ivan Huerta, Michael Holte, Thomas Moeslund, and J...
ICFCA
2010
Springer
14 years 3 months ago
Hardness of Enumerating Pseudo-intents in the Lectic Order
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
Felix Distel