5214 search results - page 223 / 1043 » The Online Specialization Problem |
175
click to vote
IJCAI
2007
15 years 7 months ago
2007
Detecting and tracking latent factors from temporal data is an important task. Most existing algorithms for latent topic detection such as Nonnegative Matrix Factorization (NMF) h...
161
click to vote
FLAIRS
2004
15 years 7 months ago
2004
Finding definitions in huge text collections is a challenging problem, not only because of the many ways in which definitions can be conveyed in natural language texts but also be...
148
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
150
click to vote
PR
2006
15 years 5 months ago
2006
The selection of valuable features is crucial in pattern recognition. In this paper we deal with the issue that part of features originate from directional instead of common linea...
193
click to vote
TNN
2008
15 years 5 months ago
2008
This paper presents a pattern classification system in which feature extraction and classifier learning are simultaneously carried out not only online but also in one pass where tr...