Sciweavers

1716 search results - page 338 / 344
» Proving Conditional Termination
Sort
View
TSP
2008
151views more  TSP 2008»
13 years 9 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
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...
Moshe Mishali, Yonina C. Eldar
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 9 months ago
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs
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...
Anindya Banerjee, David A. Naumann
BC
1998
58views more  BC 1998»
13 years 9 months ago
Detecting multimodality in saccadic reaction time distributions in gap and overlap tasks
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...
Stefan Gezeck, Jens Timmer
COMBINATORICS
1998
100views more  COMBINATORICS 1998»
13 years 9 months ago
Lattice Paths Between Diagonal Boundaries
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, ...
Heinrich Niederhausen
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 9 months ago
Linear Programming Boosting via Column Generation
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...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...