Sciweavers

8196 search results - page 321 / 1640
» Computational Modeling and Complexity Science
Sort
View
COMPLEX
2009
Springer
15 years 10 months ago
Allometric Scaling of Weighted Food Webs
Allometric scaling is an important universal property of metabolic living systems. It also describes the self-similar branching treeliked structures in transportation networks. Thi...
Jiang Zhang
GI
2010
Springer
15 years 5 months ago
Comparing Similarity Combination Methods for Schema Matching
: A recurring manual task in data integration or ontology alignment is finding mappings between complex schemas. In order to reduce the manual effort, many matching algorithms for ...
Eric Peukert, Sabine Maßmann, Kathleen K&oum...
IPPS
2007
IEEE
16 years 29 days ago
STAMP: A Universal Algorithmic Model for Next-Generation Multithreaded Machines and Systems
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...
Michel Dubois, Hyunyoung Lee, Lan Lin
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
16 years 2 days ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
ICPR
2004
IEEE
16 years 7 months ago
A Consistency-Based Model Selection for One-Class Classification
Model selection in unsupervised learning is a hard problem. In this paper a simple selection criterion for hyperparameters in one-class classifiers (OCCs) is proposed. It makes us...
David M. J. Tax, Klaus-Robert Müller