Sciweavers

5639 search results - page 352 / 1128
» Timed Abstract Non-interference
Sort
View
CPM
2008
Springer
143views Combinatorics» more  CPM 2008»
15 years 5 months ago
A Black Box for Online Approximate Pattern Matching
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
Raphaël Clifford, Klim Efremenko, Benny Porat...
IPCO
2007
126views Optimization» more  IPCO 2007»
15 years 5 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
MM
2010
ACM
137views Multimedia» more  MM 2010»
15 years 4 months ago
Unsupervised summarization of rushes videos
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...
Yang Liu, Feng Zhou, Wei Liu, Fernando De la Torre...
DCOSS
2010
Springer
15 years 4 months ago
Self-stabilizing Synchronization in Mobile Sensor Networks with Covering
Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. Phase clock is a general synchronization tool that provides ...
Joffroy Beauquier, Janna Burman
ACTA
2007
92views more  ACTA 2007»
15 years 4 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider