Sciweavers

697 search results - page 30 / 140
» On the Theory of Average Case Complexity
Sort
View
ICIS
1997
13 years 9 months ago
A case study of user participation in the information systems development process
There are many in the information systemsdiscipline who believe that user participation is necessary for successful systems development. However, it has been suggested that this b...
Thomas Butler, Brian Fitzgerald
FGCS
2008
103views more  FGCS 2008»
13 years 7 months ago
A case for cooperative and incentive-based federation of distributed clusters
Research interest in Grid computing has grown significantly over the past five years. Management of distributed resources is one of the key issues in Grid computing. Central to ma...
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
BMCBI
2004
153views more  BMCBI 2004»
13 years 7 months ago
Computational protein biomarker prediction: a case study for prostate cancer
Background: Recent technological advances in mass spectrometry pose challenges in computational mathematics and statistics to process the mass spectral data into predictive models...
Michael Wagner, Dayanand N. Naik, Alex Pothen, Sri...
CAE
2007
13 years 10 months ago
Conceptualizing Birkhoff's Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
Jaume Rigau, Miquel Feixas, Mateu Sbert
PODS
2008
ACM
141views Database» more  PODS 2008»
14 years 8 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob