Sciweavers

11214 search results - page 211 / 2243
» Just-in-time data structures
Sort
View
IJFCS
2008
110views more  IJFCS 2008»
15 years 21 days ago
Indexing Gapped-Factors Using a Tree
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
Pierre Peterlongo, Julien Allali, Marie-France Sag...
80
Voted
DATASCIENCE
2002
71views more  DATASCIENCE 2002»
15 years 15 days ago
An integrated web resource for crystallography
A recurring theme during the CODATA 2000 conference (Lake Maggiore, Italy, 15 - 19 October 2000) was the increasing convergence in data-rich branches of science between the storag...
Brian McMahon
82
Voted
TSE
2002
71views more  TSE 2002»
15 years 10 days ago
Visualizing Software Changes
A key problem in software engineering is changing the code. We present a sequence of visualizations and visual metaphors designed to help engineers understand and manage the softw...
Stephen G. Eick, Todd L. Graves, Alan F. Karr, Aud...
PAMI
2011
14 years 7 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
RIAO
2000
15 years 2 months ago
Multimedia structuring using trees
Traditionally work on multimedia structuring has been centered on the creation of indices and their use for searching. Although searching is important there are many cases where t...
George Tzanetakis, Luc Julia