1716 search results - page 338 / 344 » Proving Conditional Termination |
104
click to vote
TSP
2008
14 years 11 months ago
2008
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
95
Voted
CORR
2002
Springer
14 years 11 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
BC
1998
14 years 11 months ago
1998
In many cases the distribution of saccadic reaction times (SRT) deviates considerably from a unimodal distribution and may often exhibit several peaks. We present a statistical app...
109
click to vote
COMBINATORICS
1998
14 years 11 months ago
1998
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
114
click to vote
ML
2002
ACM
14 years 11 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...