Sciweavers

876 search results - page 94 / 176
» New Results for the Martin Polynomial
Sort
View
AAAI
2006
15 years 7 months ago
Boosting Expert Ensembles for Rapid Concept Recall
Many learning tasks in adversarial domains tend to be highly dependent on the opponent. Predefined strategies optimized for play against a specific opponent are not likely to succ...
Achim Rettinger, Martin Zinkevich, Michael H. Bowl...
ICST
2010
IEEE
15 years 4 months ago
When BDDs Fail: Conformance Testing with Symbolic Execution and SMT Solving
—Model-based testing is a well known technique that allows one to validate the correctness of software with respect to its model. If a lot of data is involved, symbolic technique...
Elisabeth Jöbstl, Martin Weiglhofer, Bernhard...
RECOMB
2004
Springer
16 years 6 months ago
A class of edit kernels for SVMs to predict translation initiation sites in eukaryotic mRNAs
The prediction of translation initiation sites (TISs) in eukaryotic mRNAs has been a challenging problem in computational molecular biology. In this paper, we present a new algori...
Haifeng Li, Tao Jiang
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 10 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 7 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau