Sciweavers

11211 search results - page 237 / 2243
» Rank-Sensitive Data Structures
Sort
View
IJFCS
2008
110views more  IJFCS 2008»
15 years 6 months 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...
DATASCIENCE
2002
71views more  DATASCIENCE 2002»
15 years 6 months 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
TSE
2002
71views more  TSE 2002»
15 years 6 months 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
15 years 1 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
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
15 years 4 months ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
Francois Carouge, Michael F. Spear