Sciweavers

1859 search results - page 276 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
WACV
2012
IEEE
14 years 11 days ago
Online discriminative object tracking with local sparse representation
We propose an online algorithm based on local sparse representation for robust object tracking. Local image patches of a target object are represented by their sparse codes with a...
Qing Wang, Feng Chen, Wenli Xu, Ming-Hsuan Yang
142
Voted
ECML
2005
Springer
15 years 10 months ago
Kernel Basis Pursuit
ABSTRACT. Estimating a non-uniformly sampled function from a set of learning points is a classical regression problem. Kernel methods have been widely used in this context, but eve...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
175
Voted
COLT
1993
Springer
15 years 9 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum
CORR
2011
Springer
186views Education» more  CORR 2011»
14 years 8 months ago
Blind Compressed Sensing Over a Structured Union of Subspaces
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
Jorge Silva, Minhua Chen, Yonina C. Eldar, Guiller...
PERCOM
2005
ACM
16 years 4 months ago
Securing Wireless Networks in a University Environment
Many applications in eLearning utilize wireless networks (WLAN) as a carrier for data and communication. These networks in their basic form are insecure, protecting the communicat...
Jochen Eisinger, Peter Winterer, Bernd Becker