Sciweavers

1176 search results - page 116 / 236
» Sparse reward processes
Sort
View
ICASSP
2008
IEEE
15 years 10 months ago
Finding needles in noisy haystacks
The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...
Rui M. Castro, Jarvis Haupt, Robert Nowak, Gil M. ...
WCNC
2008
IEEE
15 years 10 months ago
A Density Adaptive Routing Protocol for Large-Scale Ad Hoc Networks
Abstract—Position-based routing protocols use location information to refine the traditional packet flooding method in mobile ad hoc networks. They mainly focus on densely and ...
Zhizhou Li, Yaxiong Zhao, Yong Cui, Dong Xiang
NLPRS
2001
Springer
15 years 8 months ago
An Empirical Study of Feature Set Selection for Text Chunking
This paper presents an empirical study for improving the performance of text chunking. We focus on two issues: the problem of selecting feature spaces, and the problem of alleviat...
Young-Sook Hwang, Yong-Jae Kwak, Hoo-Jung Chung, S...
ICASSP
2010
IEEE
15 years 4 months ago
Structured and incoherent parametric dictionary design
A new dictionary selection approach for sparse coding, called parametric dictionary design, has recently been introduced. The aim is to choose a dictionary from a class of admissi...
Mehrdad Yaghoobi, Laurent Daudet, Michael E. Davie...
JMLR
2008
114views more  JMLR 2008»
15 years 4 months ago
Coordinate Descent Method for Large-scale L2-loss Linear Support Vector Machines
Linear support vector machines (SVM) are useful for classifying large-scale sparse data. Problems with sparse features are common in applications such as document classification a...
Kai-Wei Chang, Cho-Jui Hsieh, Chih-Jen Lin