Sciweavers

2107 search results - page 178 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
151
Voted
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
16 years 29 days ago
Exact Discovery of Time Series Motifs.
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...
141
Voted
CHI
2011
ACM
14 years 7 months ago
Characterizing the usability of interactive applications through query log analysis
People routinely rely on Internet search engines to support their use of interactive systems: they issue queries to learn how to accomplish tasks, troubleshoot problems, and other...
Adam Fourney, Richard Mann, Michael Terry
146
Voted
ECCC
2010
92views more  ECCC 2010»
15 years 2 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau
152
Voted
EH
1999
IEEE
141views Hardware» more  EH 1999»
15 years 8 months ago
On-Line Evolution of FPGA-Based Circuits: A Case Study on Hash Functions
An evolutionary algorithm is used to evolve a digital circuit which computes a simple hash function mapping a 16bit address space into an 8-bit one. The target technology is FPGA,...
Ernesto Damiani, Andrea Tettamanzi, Valentino Libe...
144
Voted
UC
2010
Springer
15 years 1 months ago
Characterising Enzymes for Information Processing: Towards an Artificial Experimenter
The information processing capabilities of many proteins are currently unexplored. The complexities and high dimensional parameter spaces make their investigation impractical. Diff...
Chris Lovell, Gareth Jones, Steve R. Gunn, Klaus-P...