Sciweavers

5699 search results - page 234 / 1140
» Alternating model trees
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 10 days ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
DAWAK
2001
Springer
15 years 10 months ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos
ACL
2010
15 years 4 months ago
Bitext Dependency Parsing with Bilingual Subtree Constraints
This paper proposes a dependency parsing method that uses bilingual constraints to improve the accuracy of parsing bilingual texts (bitexts). In our method, a targetside tree frag...
Wenliang Chen, Jun'ichi Kazama, Kentaro Torisawa
CORR
2012
Springer
222views Education» more  CORR 2012»
14 years 1 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
DASFAA
2007
IEEE
135views Database» more  DASFAA 2007»
16 years 16 days ago
A Development of Hash-Lookup Trees to Support Querying Streaming XML
Abstract. The rapid growth in the amount of XML data and the development of publish-subscribe systems have led to great interest in processing streaming XML data. We propose the Qs...
James Cheng, Wilfred Ng