Sciweavers

11212 search results - page 305 / 2243
» Semi-persistent Data Structures
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
15 years 1 months ago
The total path length of split trees
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...
Nicolas Broutin, Cecilia Holmgren
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
16 years 8 months ago
Graph Structured Views and Their Incremental Maintenance
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...
Yue Zhuge, Hector Garcia-Molina
DATESO
2009
119views Database» more  DATESO 2009»
15 years 4 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
FTDB
2008
82views more  FTDB 2008»
15 years 6 months ago
Information Extraction
The automatic extraction of information from unstructured sources has opened up new avenues for querying, organizing, and analyzing data by drawing upon the clean semantics of str...
Sunita Sarawagi
ICML
2008
IEEE
16 years 7 months ago
Structure compilation: trading structure for features
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...
Dan Klein, Hal Daumé III, Percy Liang