1176 search results - page 172 / 236 » Sparse reward processes |
129
Voted
JSAC
2008
15 years 4 months ago
2008
We propose in this work a single copy and multi-hop opportunistic routing scheme for sparse delay tolerant networks (DTNs). The scheme uses as only input the estimates of the avera...
120
click to vote
PR
2008
15 years 4 months ago
2008
We describe Nonnegative Double Singular Value Decomposition (NNDSVD), a new method designed to enhance the initialization stage of nonnegative matrix factorization (NMF). NNDSVD c...
147
click to vote
PAMI
1998
15 years 3 months ago
1998
This paper describes a framework for the estimation of shape from sparse or incomplete range data. It uses a shape representation called blending, which allows for the geometric c...
138
click to vote
IDEAL
2010
Springer
15 years 2 months ago
2010
Springer
Intrusion detection in computer networks faces the problem of a large number of both false alarms and unrecognized attacks. To improve the precision of detection, various machine l...
115
Voted
EGH
2009
Springer
15 years 1 months ago
2009
Springer
Stream compaction is a common parallel primitive used to remove unwanted elements in sparse data. This allows highly parallel algorithms to maintain performance over several proce...