Sciweavers

2498 search results - page 168 / 500
» Data Structures with Unpredictable Timing
Sort
View
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
15 years 11 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
WWW
2006
ACM
15 years 10 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 2 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
14 years 8 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro
75
Voted
BMCBI
2010
96views more  BMCBI 2010»
14 years 10 months ago
A statistical framework for differential network analysis from microarray data
Background: It has been long well known that genes do not act alone; rather groups of genes act in consort during a biological process. Consequently, the expression levels of gene...
Ryan Gill, Somnath Datta, Susmita Datta