Sciweavers

149 search results - page 13 / 30
» Crossing Numbers and Parameterized Complexity
Sort
View
APVIS
2004
13 years 9 months ago
Optimal Leaf Ordering for Two and a Half Dimensional Phylogenetic Tree Visualisation
Two and a half dimensional graph visualisation is the stacking of a set of related graphs into the third dimension to support visual comparison. A new aesthetic criterion is intro...
Tim Dwyer, Falk Schreiber
DATE
2003
IEEE
86views Hardware» more  DATE 2003»
14 years 24 days ago
Cross-Product Functional Coverage Measurement with Temporal Properties-Based Assertions
Temporal specification languages provide an efficient way to express events comprised of complex temporal scenarios. Assertions based on these languages are used to detect viola...
Avi Ziv
ICML
2000
IEEE
14 years 8 months ago
Complete Cross-Validation for Nearest Neighbor Classifiers
Cross-validation is an established technique for estimating the accuracy of a classifier and is normally performed either using a number of random test/train partitions of the dat...
Matthew D. Mullin, Rahul Sukthankar
TSMC
2011
258views more  TSMC 2011»
13 years 2 months ago
Cross-Entropy Optimization of Control Policies With Adaptive Basis Functions
—This paper introduces an algorithm for direct search of control policies in continuous-state discrete-action Markov decision processes. The algorithm looks for the best closed-l...
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
IWPEC
2009
Springer
14 years 2 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...