Sciweavers

1489 search results - page 179 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
15 years 3 months ago
XCS for robust automatic target recognition
A primary strength of the XCS approach is its ability to create maximally accurate general rules. In automatic target recognition (ATR) there is a need for robust performance beyo...
B. Ravichandran, Avinash Gandhe, Robert E. Smith
TSE
2010
155views more  TSE 2010»
14 years 4 months ago
Incremental Test Generation for Software Product Lines
Recent advances in mechanical techniques for systematic testing have increased our ability to automatically find subtle bugs, and hence to deploy more dependable software. This pap...
Engin Uzuncaova, Sarfraz Khurshid, Don S. Batory
ICDAR
2009
IEEE
15 years 4 months ago
How to Improve a Handwriting Recognition System
The recognition of handwritten characters, words, and text arouses great interest today. To develop the best working system is subject of many papers published. With this paper, m...
Haikal El Abed, Volker Märgner
PKDD
2005
Springer
153views Data Mining» more  PKDD 2005»
15 years 3 months ago
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
Marc Wörlein, Thorsten Meinl, Ingrid Fischer,...