3088 search results - page 450 / 618 » Online Passive-Aggressive Algorithms |
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
ECCV
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. The sparse representation has been widely used in many areas and utilized for visual tracking. Tracking with sparse representation is formulated as searching for samples ...
ICA
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, we propose a novel method for blind source separation (BSS) based on time-frequency sparseness (TF) that can estimate the number of sources and time-frequency masks,...
WWW
2010
ACM
13 years 10 months ago
2010
ACM
With the rapid growth in the number of online Web services, the problem of service adaptation has received significant attention. In matching and adaptation, the functional descri...
ADHOC
2007
13 years 9 months ago
2007
— In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In o...