• 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 1,367
Next 10 →

MAFFT version 5: improvement in accuracy of multiple sequence alignment

by Kazutaka Katoh, Kei-ichi Kuma, Hiroyuki Toh, Takashi Miyata - NUCLEIC ACIDS RES , 2005
"... The accuracy of multiple sequence alignment pro-gram MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, H-INS-i, F-INS-i and G-INS-i, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed high ..."
Abstract - Cited by 801 (5 self) - Add to MetaCart
The accuracy of multiple sequence alignment pro-gram MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, H-INS-i, F-INS-i and G-INS-i, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed

Very simple classification rules perform well on most commonly used datasets

by Robert C. Holte - Machine Learning , 1993
"... The classification rules induced by machine learning systems are judged by two criteria: their classification accuracy on an independent test set (henceforth "accuracy"), and their complexity. The relationship between these two criteria is, of course, of keen interest to the machin ..."
Abstract - Cited by 547 (5 self) - Add to MetaCart
to the machine learning community. There are in the literature some indications that very simple rules may achieve surprisingly high accuracy on many datasets. For example, Rendell occasionally remarks that many real world datasets have "few peaks (often just one) " and so are &

Linear spatial pyramid matching using sparse coding for image classification

by Jianchao Yang, Kai Yu, Yihong Gong, Thomas Huang - in IEEE Conference on Computer Vision and Pattern Recognition(CVPR , 2009
"... Recently SVMs using spatial pyramid matching (SPM) kernel have been highly successful in image classification. Despite its popularity, these nonlinear SVMs have a complexity O(n 2 ∼ n 3) in training and O(n) in testing, where n is the training size, implying that it is nontrivial to scaleup the algo ..."
Abstract - Cited by 497 (21 self) - Add to MetaCart
the algorithms to handle more than thousands of training images. In this paper we develop an extension of the SPM method, by generalizing vector quantization to sparse coding followed by multi-scale spatial max pooling, and propose a linear SPM kernel based on SIFT sparse codes. This new approach remarkably

Sure independence screening for ultra-high dimensional feature space

by Jianqing Fan, Jinchi Lv , 2006
"... Variable selection plays an important role in high dimensional statistical modeling which nowa-days appears in many areas and is key to various scientific discoveries. For problems of large scale or dimensionality p, estimation accuracy and computational cost are two top concerns. In a recent paper, ..."
Abstract - Cited by 283 (26 self) - Add to MetaCart
Variable selection plays an important role in high dimensional statistical modeling which nowa-days appears in many areas and is key to various scientific discoveries. For problems of large scale or dimensionality p, estimation accuracy and computational cost are two top concerns. In a recent paper

HAMMER: hierarchical attribute matching mechanism for elastic registration

by Dinggang Shen, Christos Davatzikos - IEEE Trans. on Medical Imaging , 2002
"... A new approach is presented for elastic registration of medical images, and is applied to magnetic resonance images of the brain. Experimental results demonstrate remarkably high accuracy in superposition of images from different subjects, thus enabling very precise localization of morphological cha ..."
Abstract - Cited by 278 (95 self) - Add to MetaCart
A new approach is presented for elastic registration of medical images, and is applied to magnetic resonance images of the brain. Experimental results demonstrate remarkably high accuracy in superposition of images from different subjects, thus enabling very precise localization of morphological

Remarks on the

by Propagator At, J. L. Lucio M, J. Pestieau , 1995
"... We address the problem of properly defining the W \Sigma propagator in the resonance region. Particular attention is paid to the longitudinal piece of this propagator. We also discuss the related renormalization procedures and the unitarity property. PACS Nos.: 14.70.Fm, 11.55.Bq, 11.15.-q There ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
There has been a renewed interest regarding the correct form of the massive gauge-boson propagators to be used in the resonance region [1-9]. In particular, the accuracy attained in LEP experiments regarding the Z 0 mass, has raised the question whether the extracted value of the renormalized onshell Z

A remark on computing distance functions

by Giovanni Russo, Peter Smereka - J. Comput. Phys
"... We propose a new method for the reconstruction of the signed distance function in the context of level set methods. The new method is a modification of the algorithm which makes use of the PDE equation for the distance function introduced by M. Sussman, P. Smereka, and S. Osher (1994, J. Comput. Phy ..."
Abstract - Cited by 80 (5 self) - Add to MetaCart
. Phys. 119, 146). It is based mainly on the use of a truly upwind discretization near the interface. Comparison with the previous algorithm shows a definite improvement. When used with a first-order upwind scheme, the method provides first-order accuracy for the signed distance function in the whole

Predicting the popularity of online content

by Gabor Szabo, Bernardo A. Huberman - Commun. ACM , 2010
"... We present a method for accurately predicting the long time popularity of online content from early measurements of user’s access. Using two content sharing portals, Youtube and Digg, we show that by modeling the accrual of views and votes on content offered by these services we can predict the long ..."
Abstract - Cited by 161 (7 self) - Add to MetaCart
the long-term dynamics of individual submissions from initial data. In the case of Digg, measuring access to given stories during the first two hours allows us to forecast their popularity 30 days ahead with remarkable accuracy, while downloads of Youtube videos need to be followed for 10 days to attain

Practical robust localization over large-scale 802.11 wireless networks

by Andreas Haeberlen, Algis Rudys, Eliot Flannery, Dan S. Wallach, Andrew M. Ladd, Lydia E. Kavraki - in Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MOBICOM
"... We demonstrate a system built using probabilistic techniques that allows for remarkably accurate localization across our entire office building using nothing more than the built-in signal intensity meter supplied by standard 802.11 cards. While prior systems have required significant investments of ..."
Abstract - Cited by 189 (2 self) - Add to MetaCart
We demonstrate a system built using probabilistic techniques that allows for remarkably accurate localization across our entire office building using nothing more than the built-in signal intensity meter supplied by standard 802.11 cards. While prior systems have required significant investments

Remarks on High Accuracy Geometric Hermite Interpolation

by Robert Schaback , 1989
"... . In a recent paper deBoor, Hollig, and Sabin proposed a method for local sixth-- order interpolation of convex planar curves by geometrically C 2 piecewise cubic curves, using positional, directional, and curvature data at breakpoints. This note extends their results to curves with simple zeros o ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
. In a recent paper deBoor, Hollig, and Sabin proposed a method for local sixth-- order interpolation of convex planar curves by geometrically C 2 piecewise cubic curves, using positional, directional, and curvature data at breakpoints. This note extends their results to curves with simple zeros of curvature and gives some hints to stabilize the numerical construction. Keywords. Curves, Interpolation, Geometric Continuity, Convergence Order. 1 Hermite Interpolation This paper follows the work [1] of deBoor, Hollig, and Sabin concerning Hermite interpolation of smooth curves f : IR ! IR 2 . Their piecewise cubic geometrically C 2 interpolants use positional, directional, and curvature data. They are approximations of order O(h 6 ) with respect to the maximum distance h of two adjoining interpolation points, provided that the curvature f of f does not vanish. The approximation order can drop to four in presence of double zeros of curvature, as is shown in [1] by an example. Ho...
Next 10 →
Results 1 - 10 of 1,367
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