Sciweavers

10988 search results - page 1958 / 2198
» Algorithmic Folding Complexity
Sort
View
JODL
2006
88views more  JODL 2006»
15 years 3 months ago
BroadScale: Efficient scaling of heterogeneous storage systems
Abstract Scalable storage architectures enable digital libraries and archives for the addition or removal of storage devices to increase storage capacity and bandwidth or retire ol...
Shu-Yuen Didi Yao, Cyrus Shahabi, Roger Zimmermann
ENTCS
2007
158views more  ENTCS 2007»
15 years 3 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
ML
2008
ACM
15 years 3 months ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer
EOR
2007
102views more  EOR 2007»
15 years 3 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
ML
2006
ACM
110views Machine Learning» more  ML 2006»
15 years 3 months ago
Classification-based objective functions
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
Michael Rimer, Tony Martinez
« Prev « First page 1958 / 2198 Last » Next »