524 search results - page 55 / 105 » Temporal reachability graphs |
148
click to vote
HYBRID
2009
Springer
15 years 2 months ago
2009
Springer
We introduce STORMED hybrid games (SHG), a generalization of STORMED Hybrid Systems [21], which have natural specifications, allow rich continuous dynamics and admit various proper...
148
click to vote
FOSSACS
2012
Springer
14 years 23 days ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
141
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
We present an efficient and scalable technique for spatiotemporal segmentation of long video sequences using a hierarchical graph-based algorithm. We begin by oversegmenting a vol...
256
Voted
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We present local and nonlocal algorithms for video denoising based on discrete regularization on graphs. The main difference between video and image denoising is the temporal redu...
161
Voted
MM
2006
ACM
15 years 11 months ago
2006
ACM
This paper proposes a new approach for the similarity measure and ranking of audio clips by graph modeling and matching. Instead of using frame-based or salient-based features to ...