Sciweavers

1439 search results - page 130 / 288
» Fast approximation of centrality
Sort
View
DAM
2007
177views more  DAM 2007»
15 years 24 days ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
99
Voted
ICIP
2006
IEEE
16 years 2 months ago
Efficient Reconstruction of Hexagonally Sampled Data using Three-Directional Box-Splines
Three-directional box-splines are particularly well-suited to interpolate and approximate hexagonally sampled data. In this paper, we propose a computationally efficient end-toend...
Laurent Condat, Dimitri Van De Ville, Michael Unse...
89
Voted
ICASSP
2008
IEEE
15 years 7 months ago
Implementation of message-passing algorithms for the acquisition of spreading codes
A new technique to acquire pseudo-noise (PN) sequences has been recently proposed in [1] and [2]. It is based on the paradigm of iterative Message Passing (iMP) to be run on loopy...
Massimo Rovini, Fabio Principe, Luca Fanucci, Marc...
124
Voted
IESS
2007
Springer
110views Hardware» more  IESS 2007»
15 years 7 months ago
Run-Time efficient Feasibility Analysis of Uni-Processor Systems with Static Priorities
: The performance of feasibility tests is crucial in many applications. When using feasibility tests online only a limited amount of analysis time is available. Run-time efficiency...
Karsten Albers, Frank Bodmann, Frank Slomka
82
Voted
WEA
2005
Springer
93views Algorithms» more  WEA 2005»
15 years 6 months ago
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eï¬...
Bram De Wachter, Alexandre Genon, Thierry Massart