7065 search results - page 1136 / 1413 » Iterative Scheduling Algorithms |
168
Voted
CASCON
1992
15 years 7 months ago
1992
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
165
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
194
click to vote
CIMAGING
2009
15 years 7 months ago
2009
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
184
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...
182
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...