Sciweavers

777 search results - page 24 / 156
» The Refined Process Structure Tree
Sort
View
138
Voted
PVLDB
2010
190views more  PVLDB 2010»
14 years 9 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
147
Voted
CSR
2007
Springer
15 years 8 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
128
Voted
UAI
2004
15 years 4 months ago
Dynamical Systems Trees
We propose dynamical systems trees (DSTs) as a flexible model for describing multiple processes that interact via a hierarchy of aggregating processes. DSTs extend nonlinear dynam...
Andrew Howard, Tony Jebara
102
Voted
EACL
2003
ACL Anthology
15 years 4 months ago
Finite Structure Query: A Tool for Querying Syntactically Annotated Corpora
Finite structure query (fsq for short) is a tool for querying syntactically annotated corpora. fsq employs a query language of high expressive power, namely full first order logi...
Stephan Kepser
123
Voted
ICIP
1999
IEEE
16 years 4 months ago
Representing and Retrieving Regions Using Binary Partition Trees
This paper discusses the interest of Binary Partition Trees for image and region representation in the context of indexing and similarity based retrieval. Binary Partition Trees c...
Luis Garrido, Philippe Salembier, Josep R. Casas