Sciweavers

3221 search results - page 477 / 645
» Termination of Linear Programs
Sort
View
SDM
2007
SIAM
109views Data Mining» more  SDM 2007»
15 years 7 months ago
Segmentations with Rearrangements
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
Aristides Gionis, Evimaria Terzi
DLT
2006
15 years 7 months ago
Noncanonical LALR(1) Parsing
This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing the usage of noncanonical parsers. To this end, we...
Sylvain Schmitz
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 6 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CPHYSICS
2010
135views more  CPHYSICS 2010»
15 years 6 months ago
An events based algorithm for distributing concurrent tasks on multi-core architectures
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...
David W. Holmes, John R. Williams, Peter Tilke
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 6 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard