Sciweavers

1061 search results - page 18 / 213
» Natural Selection in Relation to Complexity
Sort
View
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
14 years 8 months ago
Cluster-based concept invention for statistical relational learning
We use clustering to derive new relations which augment database schema used in automatic generation of predictive features in statistical relational learning. Clustering improves...
Alexandrin Popescul, Lyle H. Ungar
APWEB
2004
Springer
14 years 1 months ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee
CIE
2009
Springer
14 years 2 months ago
Equivalence Relations on Classes of Computable Structures
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
Ekaterina B. Fokina, Sy-David Friedman
LREC
2008
98views Education» more  LREC 2008»
13 years 9 months ago
Deriving Rhetorical Complexity Data from the RST-DT Corpus
This paper describes a study of the levels at which different rhetorical relations occur in rhetorical structure trees. In a previous empirical study (Williams and Reiter, 2003) o...
Sandra Williams, Richard Power
GRAPHICSINTERFACE
2009
13 years 5 months ago
QuickSelect: history-based selection expansion
When editing a graphical document, it is common to apply a change to multiple items at once, and a variety of tools exist for selecting sets of items. However, directly selecting ...
Sara L. Su, Sylvain Paris, Frédo Durand