Sciweavers

7129 search results - page 570 / 1426
» Approximation Algorithms for Treewidth
Sort
View
189
Voted
STOC
2005
ACM
118views Algorithms» more  STOC 2005»
16 years 7 months ago
Euclidean distortion and the sparsest cut
We prove that every n-point metric space of negative type (and, in particular, every npoint subset of L1) embeds into a Euclidean space with distortion O( log n ? log log n), a r...
Sanjeev Arora, James R. Lee, Assaf Naor
INFOCOM
2005
IEEE
16 years 1 months ago
Low-state fairness: lower bounds and practical enforcement
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...
Abhimanyu Das, Debojyoti Dutta, Ahmed Helmy, Ashis...
ICA
2004
Springer
16 years 26 days ago
Minimax Mutual Information Approach for ICA of Complex-Valued Linear Mixtures
Abstract. Recently, the authors developed the Minimax Mutual Information algorithm for linear ICA of real-valued mixtures, which is based on a density estimate stemming from Jaynes...
Jian-Wu Xu, Deniz Erdogmus, Yadunandana N. Rao, Jo...
IWCIA
2004
Springer
16 years 26 days ago
Minimum-Length Polygon of a Simple Cube-Curve in 3D Space
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
VISUALIZATION
1996
IEEE
15 years 11 months ago
Mesh Reduction with Error Control
In many cases the surfaces of geometric models consist of a large number of triangles. Several algorithms were developed to reduce the number of triangles required to approximate ...
Reinhard Klein, Gunther Liebich, Wolfgang Stra&szl...