Sciweavers

1284 search results - page 97 / 257
» Data Structures for Mergeable Trees
Sort
View
XSYM
2009
Springer
139views Database» more  XSYM 2009»
14 years 2 months ago
A Data Parallel Algorithm for XML DOM Parsing
Abstract. The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation perfor...
Bhavik Shah, Praveen Rao, Bongki Moon, Mohan Rajag...
ESA
2006
Springer
125views Algorithms» more  ESA 2006»
13 years 9 months ago
Purely Functional Worst Case Constant Time Catenable Sorted Lists
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
Gerth Stølting Brodal, Christos Makris, Kos...
CVPR
2010
IEEE
14 years 3 months ago
Detecting and Parsing Architecture at City Scale from Range Data
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
Alexander Toshev, Philippos Mordohai, Ben Taskar
ACL
2000
13 years 9 months ago
An Improved Parser for Data-Oriented Lexical-Functional Analysis
We present an LFG-DOP parser which uses fragments from LFG-annotated sentences to parse new sentences. Experiments with the Verbmobil and Homecentre corpora show that (1) Viterbi ...
Rens Bod
VLDB
2003
ACM
107views Database» more  VLDB 2003»
14 years 8 months ago
A performance study of four index structures for set-valued attributes of low cardinality
The efficient retrieval of data items on set-valued attributes is an important research topic that has attracted little attention so far. We studied and modified four index structu...
Sven Helmer, Guido Moerkotte