Sciweavers

1061 search results - page 39 / 213
» Natural Selection in Relation to Complexity
Sort
View
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
14 years 10 months ago
CrossMine: Efficient Classification Across Multiple Database Relations
Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationsh...
Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu
PEPM
2010
ACM
14 years 5 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
CG
2004
Springer
13 years 8 months ago
Views of Fibonacci dynamics
The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers...
Clifford A. Reiter
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 3 months ago
Spatio-temporal Multi-dimensional Relational Framework Trees
—The real world is composed of sets of objects that move and morph in both space and time. Useful concepts can be defined in terms of the complex interactions between the multi-...
Matthew Bodenhamer, Samuel Bleckley, Daniel Fennel...
CCA
2009
Springer
14 years 1 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich