Results 1 - 10 of 1,242

N P-completeness of generalized multi Skolem sequences

by Gustav Nordh
"... A Skolem sequence is a sequence a1,a2,...,a2n (where ai ∈ A = {1,...,n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The existence question of deciding which sets ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
of the form A = {1,...,n} are Skolem sets was solved by Thoralf Skolem [6] in 1957. Many generalizations of Skolem sequences have been studied. In this paper we prove that the existence question for generalized multi Skolem sequences is N P-complete. This can be seen as an upper bound on how far

A NOTE ON THE HARDNESS OF SKOLEM-TYPE SEQUENCES

by Gustav Nordh
"... Abstract. The purpose of this note is to give upper bounds (assuming P different from NP) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the existence question. We prove that the existence questions for both multi Skolem sequences and generalized Skolem ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. The purpose of this note is to give upper bounds (assuming P different from NP) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the existence question. We prove that the existence questions for both multi Skolem sequences and generalized

Additive Logistic Regression: a Statistical View of Boosting

by Jerome Friedman, Trevor Hastie, Robert Tibshirani - Annals of Statistics , 1998
"... Boosting (Freund & Schapire 1996, Schapire & Singer 1998) is one of the most important recent developments in classification methodology. The performance of many classification algorithms can often be dramatically improved by sequentially applying them to reweighted versions of the input dat ..."
Abstract - Cited by 1750 (25 self) - Add to MetaCart
be viewed as an approximation to additive modeling on the logistic scale using maximum Bernoulli likelihood as a criterion. We develop more direct approximations and show that they exhibit nearly identical results to boosting. Direct multi-class generalizations based on multinomial likelihood are derived

Interactive Multi-Resolution Modeling on Arbitrary Meshes

by Leif Kobbelt , Swen Campagna, Jens Vorsatz, Hans-Peter Seidel , 1998
"... During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generalize powerful multiresolution techniques to arbitrary triangle meshes without requiring subdivision connectivity. Our major o ..."
Abstract - Cited by 307 (34 self) - Add to MetaCart
During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generalize powerful multiresolution techniques to arbitrary triangle meshes without requiring subdivision connectivity. Our major

The Hierarchical Hidden Markov Model: Analysis and Applications

by Shai Fine, Yoram Singer - MACHINE LEARNING , 1998
"... . We introduce, analyze and demonstrate a recursive hierarchical generalization of the widely used hidden Markov models, which we name Hierarchical Hidden Markov Models (HHMM). Our model is motivated by the complex multi-scale structure which appears in many natural sequences, particularly in langua ..."
Abstract - Cited by 326 (3 self) - Add to MetaCart
. We introduce, analyze and demonstrate a recursive hierarchical generalization of the widely used hidden Markov models, which we name Hierarchical Hidden Markov Models (HHMM). Our model is motivated by the complex multi-scale structure which appears in many natural sequences, particularly

Perfect Skolem sets

by Gustav Nordh
"... A Skolem sequence is a sequence s1, s2,..., s2n (where si ∈ A = {1... n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The problem of deciding which sets of the for ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
A Skolem sequence is a sequence s1, s2,..., s2n (where si ∈ A = {1... n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The problem of deciding which sets

Multi-agent influence diagrams for representing and solving games

by Daphne Koller, Brian Milch - GAMES AND ECONOMIC BEHAVIOR , 2001
"... The traditional representations of games using the extensive form or the strategic (normal) form obscure much of the structure that is present in real-world games. In this paper, we propose a new representation language for general multiplayer games — multi-agent influence diagrams (MAIDs). This rep ..."
Abstract - Cited by 188 (2 self) - Add to MetaCart
The traditional representations of games using the extensive form or the strategic (normal) form obscure much of the structure that is present in real-world games. In this paper, we propose a new representation language for general multiplayer games — multi-agent influence diagrams (MAIDs

A verifiable secret shuffle and its application to E-Voting

by C. Andrew Neff , 2001
"... We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universally verifiable, multi-authority election schemes. The output of the shuffle operation is another sequence of k modular in ..."
Abstract - Cited by 217 (0 self) - Add to MetaCart
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universally verifiable, multi-authority election schemes. The output of the shuffle operation is another sequence of k modular

Fast Rotation Invariant Multi-View Face Detection Based

by Chang Huang, Student Member, Haizhou Ai, Yuan Li, Shihong Lao - on Real AdaBoost,” Proc. Sixth Int’l Conf. Automatic Face and Gesture Recognition , 2004
"... Abstract—Rotation invariant multiview face detection (MVFD) aims to detect faces with arbitrary rotation-in-plane (RIP) and rotationoff-plane (ROP) angles in still images or video sequences. MVFD is crucial as the first step in automatic face processing for general applications since face images are ..."
Abstract - Cited by 153 (18 self) - Add to MetaCart
Abstract—Rotation invariant multiview face detection (MVFD) aims to detect faces with arbitrary rotation-in-plane (RIP) and rotationoff-plane (ROP) angles in still images or video sequences. MVFD is crucial as the first step in automatic face processing for general applications since face images

Maintaining multi-modality through mixture tracking

by Jaco Vermaak, Arnaud Doucet - In ICCV , 2003
"... In recent years particle filters have become a tremendously popular tool to perform tracking for non-linear and/or non-Gaussian models. This is due to their simplicity, generality and success over a wide range of challenging applications. Particle filters, and Monte Carlo methods in general, are how ..."
Abstract - Cited by 135 (2 self) - Add to MetaCart
, are however poor at consistently maintaining the multi-modality of the target distributions that may arise due to ambiguity or the presence of multiple objects. To address this shortcoming this paper proposes to model the target distribution as a non-parametric mixture model, and presents the general tracking
Results 1 - 10 of 1,242