7006 search results - page 206 / 1402 » Approximation Algorithms |
140
click to vote
SMA
2003
ACM
15 years 8 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
119
Voted
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
117
click to vote
IDA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We present a new algorithm for approximate joint diagonalization of several symmetric matrices. While it is based on the classical least squares criterion, a novel intrin...
134
Voted
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
In this paper the blind deconvolution problem is formulated using the variational framework. With its use approximations of the involved probability distributions are developed re...
131
click to vote
RECOMB
1997
Springer
15 years 7 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...