Sciweavers

13603 search results - page 256 / 2721
» On the Complexity of Computing Treelength
Sort
View
CVPR
2010
IEEE
15 years 8 months ago
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes
Background modeling plays an important role in video surveillance, yet in complex scenes it is still a challenging problem. Among many difficulties, problems caused by illuminatio...
Shengcai Liao, Guoying Zhao, Vili Kellokumpu, Matt...
JMLR
2006
117views more  JMLR 2006»
15 years 5 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
DAC
1998
ACM
16 years 6 months ago
A Programming Environment for the Design of Complex High Speed ASICs
A C++ based programming environment for the design of complex high speed ASICs is presented. The design of a 75 Kgate DECT transceiver is used as a driver example. Compact descrip...
Patrick Schaumont, Serge Vernalde, Luc Rijnders, M...
EVOW
2009
Springer
16 years 22 days ago
Swarming for Games: Immersion in Complex Systems
Abstract. The swarm metaphor stands for dynamic, complex interaction networks with the possibility of emergent phenomena. In this work, we present two games that challenge the vide...
Sebastian von Mammen, Christian Jacob
LICS
2006
IEEE
15 years 12 months ago
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
Olivier Laurent, Lorenzo Tortora de Falco