Sciweavers

4095 search results - page 69 / 819
» How to test a tree
Sort
View
ICML
2006
IEEE
14 years 9 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
FOCS
2005
IEEE
14 years 2 months ago
Safraless Decision Procedures
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
Orna Kupferman, Moshe Y. Vardi
JMLR
2010
108views more  JMLR 2010»
13 years 3 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...
PPPJ
2009
ACM
14 years 3 months ago
Tracking performance across software revisions
Repository-based revision control systems such as CVS, RCS, Subversion, and GIT, are extremely useful tools that enable software developers to concurrently modify source code, man...
Nagy Mostafa, Chandra Krintz
BMCBI
2002
126views more  BMCBI 2002»
13 years 9 months ago
RIO: Analyzing proteomes by automated phylogenomics using resampled inference of orthologs
Background: When analyzing protein sequences using sequence similarity searches, orthologous sequences (that diverged by speciation) are more reliable predictors of a new protein&...
Christian M. Zmasek, Sean R. Eddy