Sciweavers

21984 search results - page 241 / 4397
» C
Sort
View
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
16 years 1 months ago
Piercing Translates and Homothets of a Convex Body
According to a classical result of Gr¨unbaum, the transversal number τ(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in Rd is bounded by...
Adrian Dumitrescu, Minghui Jiang
DMIN
2009
223views Data Mining» more  DMIN 2009»
15 years 4 months ago
Are Decision Trees Always Greener on the Open (Source) Side of the Fence?
- This short paper compares the performance of three popular decision tree algorithms: C4.5, C5.0, and WEKA's J48. These decision tree algorithms are all related in that C5.0 ...
Samuel Moore, Daniel D'Addario, James Kurinskas, G...
COMBINATORICS
2000
100views more  COMBINATORICS 2000»
15 years 6 months ago
Separability Number and Schurity Number of Coherent Configurations
To each coherent configuration (scheme) C and positive integer m we associate a natural scheme C(m) on the m-fold Cartesian product of the point set of C having the same automorph...
Sergei Evdokimov, Ilia N. Ponomarenko
AAECC
2004
Springer
83views Algorithms» more  AAECC 2004»
15 years 6 months ago
Bounding the Trellis State Complexity of Algebraic Geometric Codes
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
Carlos Munuera, Fernando Torres
AAECC
2007
Springer
118views Algorithms» more  AAECC 2007»
16 years 24 days ago
The "Art of Trellis Decoding" Is NP-Hard
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C′ whose minimal trellis has the least state-compl...
Navin Kashyap