Sciweavers

1174 search results - page 38 / 235
» Functional Trees
Sort
View
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
14 years 1 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
PAKDD
2007
ACM
203views Data Mining» more  PAKDD 2007»
14 years 4 months ago
Grammar Guided Genetic Programming for Flexible Neural Trees Optimization
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
Peng Wu, Yuehui Chen
COMSIS
2010
13 years 7 months ago
Generative 3D images in a visual evolutionary computing system
This paper presents a novel computer-aided design system which uses a computational approach to producing 3D images for stimulating creativity of designers. It introduces the genet...
Hong Liu
ASIACRYPT
2004
Springer
14 years 3 months ago
Higher Order Universal One-Way Hash Functions
Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from ...
Deukjo Hong, Bart Preneel, Sangjin Lee
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
14 years 7 months ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan