Sciweavers

2925 search results - page 87 / 585
» Information Complexity of Online Problems
Sort
View
KDD
2005
ACM
178views Data Mining» more  KDD 2005»
15 years 11 months ago
Failure detection and localization in component based systems by online tracking
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
SC
2009
ACM
16 years 29 days ago
Using dynamic accounts to enable access to advanced resources through science gateways
Science Gateways have emerged as a valuable solution for providing large numbers of users with access to advanced computing resources. Additionally, they can hide many of the comp...
Joseph A. Insley, Ti Leggett, Michael E. Papka
WWW
2005
ACM
15 years 11 months ago
Shared lexicon for distributed annotations on the Web
The interoperability among distributed and autonomous systems is the ultimate challenge facing the semantic web. Heterogeneity of data representation is the main source of problem...
Paolo Avesani, Marco Cova
TNN
2008
138views more  TNN 2008»
15 years 6 months ago
A Fast and Scalable Recurrent Neural Network Based on Stochastic Meta Descent
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
Zhenzhen Liu, Itamar Elhanany
DAWAK
2000
Springer
15 years 10 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton