Sciweavers

562 search results - page 14 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
15 years 5 months ago
Structure Search and Stability Enhancement of Bayesian Networks
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
Hanchuan Peng, Chris H. Q. Ding
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
15 years 26 days ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
ICCS
2007
Springer
15 years 6 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga
DAGSTUHL
2003
15 years 1 months ago
Data structures for 3D multi-tessellations: an overview
Abstract Multiresolution models support the interactive visualization of large volumetric data through selective refinement, an operation which permits to focus resolution only on...
Emanuele Danovaro, Leila De Floriani, Paola Magill...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 1 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...