Sciweavers

2434 search results - page 61 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
COMPGEOM
2000
ACM
15 years 7 months ago
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
For a sufficiently dense set of points in any closed Riemannian manifold, we prove that a unique Delannay triangulation exists. This triangulation has the same properties as in Eu...
Greg Leibon, David Letscher
ICALP
2004
Springer
15 years 8 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...
DCC
2009
IEEE
16 years 3 months ago
H.264/MPEG-4 AVC Encoder Parameter Selection Algorithms for Complexity Distortion Tradeoff
The H.264 encoder has input parameters that determine the bit rate and distortion of the compressed video and the encoding complexity. A set of encoder parameters is referred to a...
Rahul Vanam, Eve A. Riskin, Richard E. Ladner
CVPR
2007
IEEE
16 years 5 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
STOC
2000
ACM
55views Algorithms» more  STOC 2000»
15 years 7 months ago
Self-testing of universal and fault-tolerant sets of quantum gates
We consider the design of self-testers for quantum gates. A self-tester for the gates F 1, . . . , F m is a procedure that, given any gates G1, . . . , Gm, decides with high probab...
Wim van Dam, Frédéric Magniez, Miche...