11213 search results - page 189 / 2243 » Low-contention data structures |
192
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
228
click to vote
ICDE
1998
IEEE
16 years 5 months ago
1998
IEEE
We study the problem of maintaining materialized views of graph structured data. The base data consists of records containing identi ers of other records. The data could represent...
159
click to vote
DATESO
2009
15 years 2 months ago
2009
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
123
Voted
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Structured models often achieve excellent performance but can be slow at test time. We investigate structure compilation, where we replace structure with features, which are often...
142
click to vote
PAKDD
2010
ACM
15 years 2 months ago
2010
ACM
With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stre...