Sciweavers

11394 search results - page 138 / 2279
» Self-Organizing Data Structures
Sort
View
153
Voted
ESOP
2009
Springer
15 years 10 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
141
Voted
WEBDB
2010
Springer
168views Database» more  WEBDB 2010»
15 years 8 months ago
WikiAnalytics: Disambiguation of Keyword Search Results on Highly Heterogeneous Structured Data
Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogeneous dataset, where any given record has only a tiny fraction of all possible fields. Su...
Andrey Balmin, Emiran Curtmola
111
Voted
BMCBI
2007
141views more  BMCBI 2007»
15 years 3 months ago
On the origin and evolution of biosynthetic pathways: integrating microarray data with structure and organization of the Common
Background: The lysine, threonine, and methionine biosynthetic pathways share the three initial enzymatic steps, which are referred to as the Common Pathway (CP). In Escherichia c...
Marco Fondi, Matteo Brilli, Renato Fani
98
Voted
IEEEMSP
2002
IEEE
15 years 8 months ago
Factorization with missing data for 3D structure recovery
—Matrix factorization methods are now widely used to recover 3D structure from 2D projections [1]. In practice, the observation matrix to be factored out has missing data, due to...
Rui F. C. Guerreiro, Pedro M. Q. Aguiar
146
Voted
ICCS
1994
Springer
15 years 7 months ago
UDS: A Universal Data Structure
This paper gives a data structure (UDS) for supporting database retrieval, inference and machine learning that attempts to unify and extend previous work in relational databases, ...
Robert Levinson