Results 1 - 10 of 1,362

The RC5 Encryption Algorithm

by Ronald L. Rivest , 1995
"... Abstract. This document describes the RC5 encryption algorithm. RC5 is a fast symmetric block cipher suitable for hardware or software implementations. A novel feature of RC5 is the heavy use of data-dependent rotations. RC5 has a variable word size, a variable number of rounds, and a variable-lengt ..."
Abstract - Cited by 363 (7 self) - Add to MetaCart
-word (64-bit) input (plaintext) and output (ciphertext) block sizes. RC5 uses an \expanded key table, " S, derived from the user's supplied secret key. The size t of table S depends on the number r of rounds: S has t =2(r +1) words. There are thus several distinct \RC5 " algorithms

Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow

by Mathieu Desbrun , Mark Meyer, Peter Schröder, Alan H. Barr , 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating high-fidelit ..."
Abstract - Cited by 542 (23 self) - Add to MetaCart
curvature flow operator that achieves a smoothing of the shape itself, distinct from any parameterization. Additional features of the algorithm include automatic exact volume preservation, and hard and soft constraints on the positions of the points in the mesh. We compare our method to previous operators

Learning to detect objects in images via a sparse, part-based representation

by Shivani Agarwal, Aatif Awan, Dan Roth - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2004
"... We study the problem of detecting objects in still, grayscale images. Our primary focus is development of a learning-based approach to the problem, that makes use of a sparse, part-based representation. A vocabulary of distinctive object parts is automatically constructed from a set of sample image ..."
Abstract - Cited by 378 (1 self) - Add to MetaCart
We study the problem of detecting objects in still, grayscale images. Our primary focus is development of a learning-based approach to the problem, that makes use of a sparse, part-based representation. A vocabulary of distinctive object parts is automatically constructed from a set of sample

When Networks Disagree: Ensemble Methods for Hybrid Neural Networks

by Michael P. Perrone, Leaon N. Cooper , 1993
"... This paper presents a general theoretical framework for ensemble methods of constructing significantly improved regression estimates. Given a population of regression estimators, we construct a hybrid estimator which is as good or better in the MSE sense than any estimator in the population. We argu ..."
Abstract - Cited by 349 (3 self) - Add to MetaCart
in functional space which helps to avoid over-fitting. 4) It utilizes local minima to construct improved estimates whereas other neural network algorithms are hindered by local minima. 5) It is ideally suited for parallel computation. 6) It leads to a very useful and natural measure of the number of distinct

Quantum Algorithms for Element Distinctness

by Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald Wolf - SIAM Journal of Computing , 2001
"... We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Høyer, and Tapp, and imply an O(N 3/4 log N) quantum upper bound for the element distinctness problem in the comparison c ..."
Abstract - Cited by 75 (9 self) - Add to MetaCart
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Høyer, and Tapp, and imply an O(N 3/4 log N) quantum upper bound for the element distinctness problem in the comparison

QuickTime Reference Guide, QuickTime CD

by Helmut Grabner, Michael Grabner, Horst Bischof - In Proc. 17th British Machine Vision Conference , 2006
"... Very recently tracking was approached using classification techniques such as support vector machines. The object to be tracked is discriminated by a classifier from the background. In a similar spirit we propose a novel on-line AdaBoost feature selection algorithm for tracking. The distinct advanta ..."
Abstract - Cited by 156 (16 self) - Add to MetaCart
Very recently tracking was approached using classification techniques such as support vector machines. The object to be tracked is discriminated by a classifier from the background. In a similar spirit we propose a novel on-line AdaBoost feature selection algorithm for tracking. The distinct

Rate-Controlled Service Disciplines

by Hui Zhang, Domenico Ferrari , 1994
"... We propose a class of non-work-conserving service disciplines, called the Rate-Controlled Service Disciplines. When coupled with suitable admission control algorithms, Rate-Controlled Service Disciplines can provide end-to-end deterministic and statistical performance guarantees on a per-connectio ..."
Abstract - Cited by 149 (10 self) - Add to MetaCart
node analysis at each switch. It also has several other distinct advantages: it decouples the allocation of bandwidths and delay bounds, uniformly distributes the allocation of buffer space inside the network to prevent packet loss, and allows arbitrary combinations of rate-control policies

HAPLO: A Program Using the EM Algorithm to Estimate the Frequencies of Multi-site Haplotypes

by M. E. Hawley, K. K. Kidd , 1995
"... A DNA haplotype system combines information from two or more distinct polymorphic systems located within a small length of DNA in which there is little recombination. Each possible combination of alleles, one from each component system, constitutes a distinct haplotype that is treated as an allele o ..."
Abstract - Cited by 92 (3 self) - Add to MetaCart
A DNA haplotype system combines information from two or more distinct polymorphic systems located within a small length of DNA in which there is little recombination. Each possible combination of alleles, one from each component system, constitutes a distinct haplotype that is treated as an allele

Feature Correspondence via Graph Matching: Models and Global Optimization

by Lorenzo Torresani, Vladimir Kolmogorov, Carsten Rother
"... Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter and occlusion, such as points extracted from a pair of images containing a human figure in distinct poses. We formulate th ..."
Abstract - Cited by 120 (1 self) - Add to MetaCart
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter and occlusion, such as points extracted from a pair of images containing a human figure in distinct poses. We formulate

Wait-Free Algorithms for Fast, Long-Lived Renaming

by Mark Moir, James H. Anderson - Science of Computer Programming , 1995
"... We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems [3, 5]. In the renaming problem, processes are required to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is depen ..."
Abstract - Cited by 79 (14 self) - Add to MetaCart
that is dependent on the size of the original name space, and allow processes to acquire names only once. In this paper, we present several new renaming algorithms. Most of our algorithms have time complexity that is independent of the size of the original name space, and some of our algorithms solve a new, more
Results 1 - 10 of 1,362