2124 search results - page 142 / 425 » Repairing Structurally Complex Data |
119
click to vote
GIR
2006
ACM
15 years 6 months ago
2006
ACM
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
99
Voted
CIKM
1994
Springer
15 years 4 months ago
1994
Springer
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
109
Voted
BMCBI
2010
15 years 23 days ago
2010
Background: New technologies are enabling the measurement of many types of genomic and epigenomic information at scales ranging from the atomic to nuclear. Much of this new data i...
129
click to vote
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
We present an algorithm, Hierarchical ISOmetric SelfOrganizing Map (H-ISOSOM), for a concise, organized manifold representation of complex, non-linear, large scale, high-dimension...
109
Voted
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...