Sciweavers

6715 search results - page 1057 / 1343
» Learning from a Test Set
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 5 months ago
Viewpoints: A high-performance high-dimensional exploratory data analysis tool
Scientific data sets continue to increase in both size and complexity. In the past, dedicated graphics systems at supercomputing centers were required to visualize large data sets,...
Paul R. Gazis, C. Levit, Michael J. Way
COLT
2005
Springer
16 years 7 days ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
BMCBI
2007
147views more  BMCBI 2007»
15 years 6 months ago
Hon-yaku: a biology-driven Bayesian methodology for identifying translation initiation sites in prokaryotes
Background: Computational prediction methods are currently used to identify genes in prokaryote genomes. However, identification of the correct translation initiation sites remain...
Yuko Makita, Michiel J. L. de Hoon, Antoine Danchi...
KDD
2012
ACM
183views Data Mining» more  KDD 2012»
13 years 9 months ago
Mining discriminative components with low-rank and sparsity constraints for face recognition
This paper introduces a novel image decomposition approach for an ensemble of correlated images, using low-rank and sparsity constraints. Each image is decomposed as a combination...
Qiang Zhang, Baoxin Li
CVPR
2000
IEEE
16 years 8 months ago
Improving Visual Matching
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared di erences ...
Michael S. Lew, Nicu Sebe, Thomas S. Huang
« Prev « First page 1057 / 1343 Last » Next »