Sciweavers

1218 search results - page 68 / 244
» Scaling up a
Sort
View
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
14 years 10 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
ICML
2009
IEEE
14 years 9 months ago
Online dictionary learning for sparse coding
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
ICML
2008
IEEE
14 years 9 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
SOFSEM
2009
Springer
14 years 6 months ago
Time and Fairness in a Process Algebra with Non-blocking Reading
We introduce the first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems. We study the impact this new kind of actions has on fairnes...
Flavio Corradini, Maria Rita Di Berardini, Walter ...
ICSOC
2009
Springer
14 years 3 months ago
Another Approach to Service Instance Migration
Services change over time, be it for internal improvements, be it for external requirements such as new legal regulations. For long running services, it may even be necessary to ch...
Nannette Liske, Niels Lohmann, Christian Stahl, Ka...