Sciweavers

11231 search results - page 181 / 2247
» Digging for Data Structures
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 2 months ago
Random Projection Trees Revisited
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
Aman Dhesi, Purushottam Kar
LREC
2010
143views Education» more  LREC 2010»
15 years 4 months ago
A Flexible Representation of Heterogeneous Annotation Data
This paper describes a new flexible representation for the annotation of complex structures of metadata over heterogeneous data collections containing text and other types of medi...
Richard Johansson, Alessandro Moschitti
104
Voted
SPAA
2005
ACM
15 years 8 months ago
Concurrent cache-oblivious b-trees
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our ...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...
CAISE
1992
Springer
15 years 6 months ago
Data Modelling in Complex Application Domains
In many non trivial application domains, object types with a complex structure occur. Data modelling techniques which only allow flat structures are not suitable for representing ...
Arthur H. M. ter Hofstede, Henderik Alex Proper, T...
AUSAI
2009
Springer
15 years 9 months ago
A Graph Distance Based Structural Clustering Approach for Networks
In the era of information explosion, structured data emerge on a large scale. As a description of structured data, network has drawn attention of researchers in many subjects. Netw...
Xin Su, Chunping Li