Sciweavers

3495 search results - page 624 / 699
» On the random satisfiable process
Sort
View
MP
2002
103views more  MP 2002»
15 years 5 months ago
Detecting Jacobian sparsity patterns by Bayesian probing
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...
Andreas Griewank, Christo Mitev
TCS
2002
15 years 5 months ago
Asymptotic behavior in a heap model with two pieces
In a heap model, solid blocks, or pieces, pile up according to the Tetris game mechanism. An optimal schedule is an in nite sequence of pieces minimizing the asymptotic growth rat...
Jean Mairesse, Laurent Vuillon
TCSV
2002
229views more  TCSV 2002»
15 years 5 months ago
Automatic segmentation of moving objects in video sequences: a region labeling approach
Abstract--The emerging video coding standard MPEG-4 enables various content-based functionalities for multimedia applications. To support such functionalities, as well as to improv...
Yaakov Tsaig, Amir Averbuch
SAC
2008
ACM
15 years 5 months ago
Whom should I trust?: the impact of key figures on cold start recommendations
Generating adequate recommendations for newcomers is a hard problem for a recommender system (RS) due to lack of detailed user profiles and social preference data. Empirical evide...
Patricia Victor, Chris Cornelis, Ankur Teredesai, ...
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 4 months ago
The LASSO risk for gaussian matrices
We consider the problem of learning a coefficient vector x0 ∈ RN from noisy linear observation y = Ax0 + w ∈ Rn . In many contexts (ranging from model selection to image proce...
Mohsen Bayati, Andrea Montanari