Sciweavers

1061 search results - page 22 / 213
» Natural Selection in Relation to Complexity
Sort
View
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 2 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
ICDE
2002
IEEE
153views Database» more  ICDE 2002»
14 years 9 months ago
From XML Schema to Relations: A Cost-Based Approach to XML Storage
As Web applications manipulate an increasing amount of XML, there is a growing interest in storing XML data in relational databases. Due to the mismatch between the complexity of ...
Jérôme Siméon, Juliana Freire,...
INFORMATICALT
2002
82views more  INFORMATICALT 2002»
13 years 7 months ago
Data Aggregation Sets in Adaptive Data Model
This article presents the ways of identification, selection and transformation of the data into other structures. Relation selection and transformation may change data quantity and...
Petras Gailutis Adomenas, Algirdas Ciucelis
ACL
2006
13 years 9 months ago
Factorizing Complex Models: A Case Study in Mention Detection
As natural language understanding research advances towards deeper knowledge modeling, the tasks become more and more complex: we are interested in more nuanced word characteristi...
Radu Florian, Hongyan Jing, Nanda Kambhatla, Imed ...
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
14 years 9 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...