• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 11,513
Next 10 →

Efficient Variants of the ICP Algorithm

by Szymon Rusinkiewicz, Marc Levoy - INTERNATIONAL CONFERENCE ON 3-D DIGITAL IMAGING AND MODELING , 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract - Cited by 718 (5 self) - Add to MetaCart
to the minimization strategy. We enumerate and classify many of these variants, and evaluate their effect on the speed with which the correct alignment is reached. In order to improve convergence for nearly-flat meshes with small features, such as inscribed surfaces, we introduce a new variant based on uniform

Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm

by Nick Littlestone - Machine Learning , 1988
"... learning Boolean functions, linear-threshold algorithms Abstract. Valiant (1984) and others have studied the problem of learning various classes of Boolean functions from examples. Here we discuss incremental learning of these functions. We consider a setting in which the learner responds to each ex ..."
Abstract - Cited by 773 (5 self) - Add to MetaCart
algorithms are available that make a bounded number of mistakes, with the bound independent of the number of examples seen by the learner. We present one such algorithm that learns disjunctive Boolean functions, along with variants for learning other classes of Boolean functions. The basic method can

A study of translation edit rate with targeted human annotation

by Matthew Snover, Bonnie Dorr, Richard Schwartz, Linnea Micciulla, John Makhoul - In Proceedings of Association for Machine Translation in the Americas , 2006
"... We examine a new, intuitive measure for evaluating machine-translation output that avoids the knowledge intensiveness of more meaning-based approaches, and the labor-intensiveness of human judgments. Translation Edit Rate (TER) measures the amount of editing that a human would have to perform to cha ..."
Abstract - Cited by 583 (9 self) - Add to MetaCart
We examine a new, intuitive measure for evaluating machine-translation output that avoids the knowledge intensiveness of more meaning-based approaches, and the labor-intensiveness of human judgments. Translation Edit Rate (TER) measures the amount of editing that a human would have to perform

Differential Cryptanalysis of DES-like Cryptosystems

by Eli Biham, Adi Shamir - CRYPTO'91 , 1991
"... The Data Encryption Standard (DES) is the best known and most widely used cryptosystem for civilian applications. It was developed at IBM and adopted by the National Buraeu of Standards in the mid 70's, and has successfully withstood all the attacks published so far in the open literature. In t ..."
Abstract - Cited by 676 (9 self) - Add to MetaCart
. In this paper we develop a new type of cryptanalytic attack which can break the reduced variant of DES with eight rounds in a few minutes on a PC and can break any reduced variant of DES (with up to 15 rounds) in less than 2 56 operations. The new attack can be applied to a variety of DES-like substitution

A new variant of Creutzfeldt-Jakob disease

by R. G. Will, G. Stewart, M. Zeidler, M. A. Macleod, R. S. G. Knight, R. G. Will - in the UK. Lancet , 1996
"... This article cites 0 articles, 0 of which you can access for free at: permissions ..."
Abstract - Cited by 162 (2 self) - Add to MetaCart
This article cites 0 articles, 0 of which you can access for free at: permissions

Fast and accurate short read alignment with Burrows-Wheeler transform

by Heng Li, Richard Durbin - BIOINFORMATICS, 2009, ADVANCE ACCESS , 2009
"... Motivation: The enormous amount of short reads generated by the new DNA sequencing technologies call for the development of fast and accurate read alignment programs. A first generation of hashtable based methods has been developed, including MAQ, which is accurate, feature rich and fast enough to a ..."
Abstract - Cited by 2096 (24 self) - Add to MetaCart
reads, e.g. from Illumina sequencing machines, and color space reads from AB SOLiD machines. Evaluations on both simulated and real data suggest that BWA is ∼10–20X faster than MAQ while achieving similar accuracy. In addition, BWA outputs alignment in the new standard SAM format. Variant calling

The SWISS-PROT protein sequence data bank and its supplement TrEMBL in 1999

by Amos Bairoch, Rolf Apweiler - Nucleic Acids Res , 1999
"... SWISS-PROT is a curated protein sequence database which strives to provide a high level of annotation (such as the description of the function of a protein, its domain structure, post-translational modifications, variants, etc.), a minimal level of redundancy and high level of integration with other ..."
Abstract - Cited by 624 (5 self) - Add to MetaCart
SWISS-PROT is a curated protein sequence database which strives to provide a high level of annotation (such as the description of the function of a protein, its domain structure, post-translational modifications, variants, etc.), a minimal level of redundancy and high level of integration

A taxonomy and evaluation of dense two-frame stereo correspondence algorithms.

by Daniel Scharstein , Richard Szeliski - In IEEE Workshop on Stereo and Multi-Baseline Vision, , 2001
"... Abstract Stereo matching is one of the most active research areas in computer vision. While a large number of algorithms for stereo correspondence have been developed, relatively little work has been done on characterizing their performance. In this paper, we present a taxonomy of dense, two-frame ..."
Abstract - Cited by 1546 (22 self) - Add to MetaCart
-frame stereo methods. Our taxonomy is designed to assess the different components and design decisions made in individual stereo algorithms. Using this taxonomy, we compare existing stereo methods and present experiments evaluating the performance of many different variants. In order to establish a common

Discrete Choice Methods with Simulation

by Kenneth E. Train , 2002
"... This book describes the new generation of discrete choice meth-ods, focusing on the many advances that are made possible by simulation. Researchers use these statistical methods to examine the choices that consumers, households, firms, and other agents make. Each of the major models is covered: logi ..."
Abstract - Cited by 1326 (20 self) - Add to MetaCart
This book describes the new generation of discrete choice meth-ods, focusing on the many advances that are made possible by simulation. Researchers use these statistical methods to examine the choices that consumers, households, firms, and other agents make. Each of the major models is covered

Large Margin Classification Using the Perceptron Algorithm

by Yoav Freund, Robert E. Schapire - Machine Learning , 1998
"... We introduce and analyze a new algorithm for linear classification which combines Rosenblatt 's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like Vapnik 's maximal-margin classifier, our algorithm takes advantage of data that are linearly separable with large ..."
Abstract - Cited by 521 (2 self) - Add to MetaCart
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt 's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like Vapnik 's maximal-margin classifier, our algorithm takes advantage of data that are linearly separable
Next 10 →
Results 1 - 10 of 11,513
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University