Sciweavers

8431 search results - page 1538 / 1687
» Algorithmically Independent Sequences
Sort
View
166
Voted
COLT
1999
Springer
15 years 10 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
183
Voted
SIGGRAPH
1998
ACM
15 years 10 months ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...
161
Voted
CVPR
1997
IEEE
15 years 10 months ago
True Multi-Image Alignment and its Application to Mosaicing and Lens Distortion Correction
Multiple images of a scene are related through 20/3D view transformations and linear and non-linear camera transformations. In all the traditional techniques to compute these tran...
Harpreet S. Sawhney, Rakesh Kumar
SIGGRAPH
1997
ACM
15 years 10 months ago
Creating full view panoramic image mosaics and environment maps
This paper presents a novel approach to creating full view panoramic mosaics from image sequences. Unlike current panoramic stitching methods, which usually require pure horizonta...
Richard Szeliski, Heung-Yeung Shum
145
Voted
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
15 years 10 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
« Prev « First page 1538 / 1687 Last » Next »