Sciweavers

604 search results - page 58 / 121
» On the Complexity of the Maximum Cut Problem
Sort
View
PPOPP
2005
ACM
15 years 3 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
ICPR
2010
IEEE
15 years 4 months ago
Integrating a Discrete Motion Model into GMM Based Background Subtraction
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
Christian Wolf, Jolion Jolion
COMPGEOM
2009
ACM
15 years 4 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
WAPCV
2007
Springer
15 years 3 months ago
Context Driven Focus of Attention for Object Detection
Abstract. Context plays an important role in general scene perception. In particular, it can provide cues about an object’s location within an image. In computer vision, object d...
Roland Perko, Ales Leonardis
QSIC
2005
IEEE
15 years 3 months ago
Formal Fault Tree Analysis of State Transition Systems
Fault Tree Analysis (FTA) is a traditional deductive safety analysis technique that is applied during the system design stage. However, traditional FTA does not consider transitio...
Jianwen Xiang, Kazuhiro Ogata