Sciweavers

1998 search results - page 278 / 400
» Complexity of the Cover Polynomial
Sort
View
NIPS
2007
15 years 2 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet
SIGSOFT
2004
ACM
16 years 1 months ago
Merging partial behavioural models
Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners have adopted techniques that support increment...
Marsha Chechik, Sebastián Uchitel
192
Voted
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
16 years 27 days ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
110
Voted
ISCA
2009
IEEE
136views Hardware» more  ISCA 2009»
15 years 7 months ago
Architectural core salvaging in a multi-core processor for hard-error tolerance
The incidence of hard errors in CPUs is a challenge for future multicore designs due to increasing total core area. Even if the location and nature of hard errors are known a prio...
Michael D. Powell, Arijit Biswas, Shantanu Gupta, ...
ESWS
2009
Springer
15 years 7 months ago
Evolva: A Comprehensive Approach to Ontology Evolution
Ontology evolution is increasingly gaining momentum in the area of Semantic Web research. Current approaches target the evolution in terms of either content, or change management, ...
Fouad Zablith