Sciweavers

2168 search results - page 250 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
135
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
Inequalities for the curvature of curves and surfaces
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
David Cohen-Steiner, Herbert Edelsbrunner
125
Voted
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 5 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
120
Voted
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 11 days ago
Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...
Gilles Meyer, Silvere Bonnabel, Rodolphe Sepulchre
121
Voted
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
16 years 4 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
138
Voted
DCC
2005
IEEE
16 years 3 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...