Sciweavers

400 search results - page 54 / 80
» Extended formulations in combinatorial optimization
Sort
View
CVPR
2008
IEEE
14 years 8 months ago
Discriminative learned dictionaries for local image analysis
Sparse signal models have been the focus of much recent research, leading to (or improving upon) state-of-the-art results in signal, image, and video restoration. This article ext...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
ICPR
2002
IEEE
14 years 7 months ago
Trajectory Segmentation Using Dynamic Programming
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
Richard Mann, Allan D. Jepson, Thomas F. El-Maragh...
ICML
2003
IEEE
14 years 7 months ago
Weighted Low-Rank Approximations
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
Nathan Srebro, Tommi Jaakkola
DFT
2003
IEEE
246views VLSI» more  DFT 2003»
14 years 2 days ago
Low Cost Convolutional Code Based Concurrent Error Detection in FSMs
We discuss the use of convolutional codes to perform concurrent error detection (CED) in finite state machines (FSMs). We examine a previously proposed methodology, we identify i...
Konstantinos Rokas, Yiorgos Makris, Dimitris Gizop...
GI
2009
Springer
13 years 11 months ago
A Game-Theoretic Model for Distributed Programming by Contract
: We present an extension of the programming-by-contract (PBC) paradigm to a concurrent and distributed environment. Classical PBC is characterized by absolute conformance of code ...
Anders Starcke Henriksen, Tom Hvitved, Andrzej Fil...