Sciweavers

1477 search results - page 66 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
15 years 10 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
ECCV
2010
Springer
15 years 2 months ago
A Stochastic Graph Evolution Framework for Robust Multi-Target Tracking
Maintaining the stability of tracks on multiple targets in video over extended time periods remains a challenging problem. A few methods which have recently shown encouraging resul...
EPIA
2007
Springer
15 years 4 months ago
GRASPER
In this paper we present GRASPER, a graph constraint solver, based on set constraints. We specify GRASPER’s constraints and we make use of our framework to model a problem in the...
Ruben Duarte Viegas, Francisco Azevedo
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
15 years 1 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
CVPR
2012
IEEE
12 years 12 months ago
A Unified Framework for Event Summarization and Rare Event Detection
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
Junseok Kwon and Kyoung Mu Lee