Sciweavers

9842 search results - page 1834 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
14 years 3 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
POLICY
2004
Springer
14 years 3 months ago
DecisionQoS: An Adaptive, Self-Evolving QoS Arbitration Module for Storage Systems
As a consequence of the current trend towards consolidating computing, storage and networking infrastructures into large centralized data centers, applications compete for shared ...
Sandeep Uttamchandani, Guillermo A. Alvarez, Gul A...
SELMAS
2004
Springer
14 years 3 months ago
Systematic Integration Between Requirements and Architecture
Software systems of today are characterized by the increasing size, complexity, distribution and heterogeneity. Understanding and supporting the interaction between software requi...
Lúcia R. D. Bastos, Jaelson Brelaz de Castr...
SOFTCO
2004
Springer
14 years 3 months ago
Designing Neural Networks Using Gene Expression Programming
Abstract. An artificial neural network with all its elements is a rather complex structure, not easily constructed and/or trained to perform a particular task. Consequently, severa...
Cândida Ferreira
SPATIALCOGNITION
2004
Springer
14 years 3 months ago
Branching Allen
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
Marco Ragni, Stefan Wölfl
« Prev « First page 1834 / 1969 Last » Next »