Results 1 - 10 of 3,522

A practical guide to support vector classification

by Chih-wei Hsu, Chih-chung Chang, Chih-jen Lin , 2010
"... The support vector machine (SVM) is a popular classification technique. However, beginners who are not familiar with SVM often get unsatisfactory results since they miss some easy but significant steps. In this guide, we propose a simple procedure which usually gives reasonable results. ..."
Abstract - Cited by 823 (7 self) - Add to MetaCart
The support vector machine (SVM) is a popular classification technique. However, beginners who are not familiar with SVM often get unsatisfactory results since they miss some easy but significant steps. In this guide, we propose a simple procedure which usually gives reasonable results.

A View Of The Em Algorithm That Justifies Incremental, Sparse, And Other Variants

by Radford Neal, Geoffrey E. Hinton - Learning in Graphical Models , 1998
"... . The EM algorithm performs maximum likelihood estimation for data in which some variables are unobserved. We present a function that resembles negative free energy and show that the M step maximizes this function with respect to the model parameters and the E step maximizes it with respect to the d ..."
Abstract - Cited by 993 (18 self) - Add to MetaCart
to the distribution over the unobserved variables. From this perspective, it is easy to justify an incremental variant of the EM algorithm in which the distribution for only one of the unobserved variables is recalculated in each E step. This variant is shown empirically to give faster convergence in a mixture

Flexible camera calibration by viewing a plane from unknown orientations

by Zhengyou Zhang , 1999
"... We propose a flexible new technique to easily calibrate a camera. It only requires the camera to observe a planar pattern shown at a few (at least two) different orientations. Either the camera or the planar pattern can be freely moved. The motion need not be known. Radial lens distortion is modeled ..."
Abstract - Cited by 511 (7 self) - Add to MetaCart
techniques which use expensive equipment such as two or three orthogonal planes, the proposed technique is easy to use and flexible. It advances 3D computer vision one step from laboratory environments to real world use. The corresponding software is available from the author’s Web page.

A Singular Value Thresholding Algorithm for Matrix Completion

by Jian-Feng Cai, Emmanuel J. Candès, Zuowei Shen , 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract - Cited by 555 (22 self) - Add to MetaCart
of recovering a large matrix from a small subset of its entries (the famous Netflix problem). Off-the-shelf algorithms such as interior point methods are not directly amenable to large problems of this kind with over a million unknown entries. This paper develops a simple first-order and easy

Stable Fluids

by Jos Stam , 1999
"... Building animation tools for fluid-like motions is an important and challenging problem with many applications in computer graphics. The use of physics-based models for fluid flow can greatly assist in creating such tools. Physical models, unlike key frame or procedural based techniques, permit an a ..."
Abstract - Cited by 568 (9 self) - Add to MetaCart
to the fact that previous models used unstable schemes to solve the physical equations governing a fluid. In this paper, for the first time, we propose an unconditionally stable model which still produces complex fluid-like flows. As well, our method is very easy to implement. The stability of our model

Featherweight Java: A Minimal Core Calculus for Java and GJ

by Atsushi Igarashi, Benjamin C. Pierce, Philip Wadler - ACM Transactions on Programming Languages and Systems , 1999
"... Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features of the fu ..."
Abstract - Cited by 659 (23 self) - Add to MetaCart
Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features

A PDE-Based Fast Local Level Set Method

by Danping Peng, Barry Merriman, Stanley Osher, Hongkai Zhao, Myungjoo Kang - Journal of Computational Physics , 1999
"... this paper we localize the level set method. Our localization works in as much generality as does the original method and all of its recent variants [27, 28], but requires an order of magnitude less computing effort. Earlier work on localization was done by Adalsteinsson and Sethian [1]. Our approac ..."
Abstract - Cited by 266 (26 self) - Add to MetaCart
approach differs from theirs in that we use only the values of the level set function (or functions, for multiphase flow) and not the explicit location of points in the domain. Our implementation is easy and straightforward and has been used in [9, 14, 27, 28]. Our approach is partial differential equation

Bayesian inference on phylogeny and its impact on evolutionary biology.

by John P Huelsenbeck , Fredrik Ronquist , Rasmus Nielsen , Jonathan P Bollback - Science , 2001
"... 1 As a discipline, phylogenetics is becoming transformed by a flood of molecular data. These data allow broad questions to be asked about the history of life, but also present difficult statistical and computational problems. Bayesian inference of phylogeny brings a new perspective to a number of o ..."
Abstract - Cited by 235 (10 self) - Add to MetaCart
). Usually all trees are considered a priori equally probable, and the likelihood is calculated under one of a number of standard Markov models of character evolution. The posterior probability, although easy to formulate, involves a summation over all trees and, for each tree, integration over all possible

An Analysis of Single-Layer Networks in Unsupervised Feature Learning

by Adam Coates, Honglak Lee, Andrew Y. Ng
"... A great deal of research has focused on algorithms for learning features from unlabeled data. Indeed, much progress has been made on benchmark datasets like NORB and CIFAR by employing increasingly complex unsupervised learning algorithms and deep models. In this paper, however, we show that several ..."
Abstract - Cited by 223 (19 self) - Add to MetaCart
and K-means clustering, Gaussian mixtures) to NORB and CIFAR datasets using only single-layer networks. We then present a detailed analysis of the effect of changes in the model setup: the receptive field size, number of hidden nodes (features), the step-size (“stride”) between extracted features

Behavior Protocols for Software Components

by Frantisek Plasil, Stanislav Visnovsky - IEEE Transactions on Software Engineering , 2002
"... In this paper, we propose a means to enhance an architecture description language with a description of component behavior. A notation used for this purpose should be able to express the "interplay" on the component's interfaces and reflect step-by-step refinement of the component& ..."
Abstract - Cited by 212 (32 self) - Add to MetaCart
In this paper, we propose a means to enhance an architecture description language with a description of component behavior. A notation used for this purpose should be able to express the "interplay" on the component's interfaces and reflect step-by-step refinement of the component
Results 1 - 10 of 3,522