Sciweavers

92 search results - page 11 / 19
» Maximal repetitions in strings
Sort
View
AIEDU
2008
112views more  AIEDU 2008»
13 years 5 months ago
Be Brief, And They Shall Learn: Generating Concise Language Feedback for a Computer Tutor
To investigate whether more concise Natural Language feedback improves learning, we developed two Natural Language generators (DIAG-NLP1 and DIAG-NLP2), to provide feedback in an I...
Barbara Di Eugenio, Davide Fossati, Susan M. Halle...
MTA
2010
175views more  MTA 2010»
13 years 5 months ago
Automatic summarization of rushes video using bipartite graphs
In this paper we present a new approach for automatic summarization of rushes video. Our approach is composed of three main steps. First, based on a temporal segmentation, we filte...
Liang Bai, Yan-Li Hu, Songyang Lao, Alan F. Smeato...
ISPASS
2006
IEEE
14 years 22 days ago
Accelerating architectural exploration using canonical instruction segments
Detailed microarchitectural simulators are not well suited for exploring large design spaces due to their excessive simulation times. We introduce AXCIS, a framework for fast and ...
Rose F. Liu, Krste Asanovic
CPM
2001
Springer
211views Combinatorics» more  CPM 2001»
13 years 11 months ago
Fuzzy Hamming Distance: A New Dissimilarity Measure
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
Abraham Bookstein, Shmuel T. Klein, Timo Raita
CPM
2004
Springer
87views Combinatorics» more  CPM 2004»
14 years 3 days ago
A Trie-Based Approach for Compacting Automata
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
Maxime Crochemore, Chiara Epifanio, Roberto Grossi...