Sciweavers

331 search results - page 7 / 67
» Comparing Reductions to NP-Complete Sets
Sort
View
BMCBI
2006
128views more  BMCBI 2006»
13 years 7 months ago
Comparative assessment of performance and genome dependence among phylogenetic profiling methods
Background: The rapidly increasing speed with which genome sequence data can be generated will be accompanied by an exponential increase in the number of sequenced eukaryotes. Wit...
Evan S. Snitkin, Adam M. Gustafson, Joseph C. Mell...
ECAI
2000
Springer
13 years 11 months ago
Data Set Editing by Ordered Projection
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
Jesús S. Aguilar-Ruiz, José Crist&oa...
NIPS
2004
13 years 8 months ago
Sparse Coding of Natural Images Using an Overcomplete Set of Limited Capacity Units
It has been suggested that the primary goal of the sensory system is to represent input in such a way as to reduce the high degree of redundancy. Given a noisy neural representati...
Eizaburo Doi, Michael S. Lewicki
TC
2010
13 years 2 months ago
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...
ICFHR
2010
151views Biometrics» more  ICFHR 2010»
13 years 2 months ago
Error Reduction by Confusing Characters Discrimination for Online Handwritten Japanese Character Recognition
To reduce the classification errors of online handwritten Japanese character recognition, we propose a method for confusing characters discrimination with little additional costs....
Xiang-Dong Zhou, Da-Han Wang, Masaki Nakagawa, Che...