Sciweavers

247 search results - page 20 / 50
» Two Size Measures for Timed Languages
Sort
View
CIVR
2005
Springer
133views Image Analysis» more  CIVR 2005»
14 years 1 months ago
Hot Event Detection and Summarization by Graph Modeling and Matching
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
Yuxin Peng, Chong-Wah Ngo
ENTCS
2007
128views more  ENTCS 2007»
13 years 7 months ago
Optimisation Validation
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
David Aspinall, Lennart Beringer, Alberto Momiglia...
ACISICIS
2010
IEEE
13 years 9 months ago
Modeling Software Project Monitoring with Stakeholders
Recently, software size becomes larger, and consequently, not only a software developer but also a software purchaser suffers considerable losses by software project failure. So av...
Masateru Tsunoda, Tomoko Matsumura, Ken-ichi Matsu...
CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
14 years 2 months ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman
DLT
2004
13 years 9 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda