Sciweavers

130 search results - page 8 / 26
» Binary Representations for General CSPs
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
One step beyond histograms: Image representation using Markov stationary features
This paper proposes a general framework called Markov stationary features (MSF) to extend histogram based features. The MSF characterizes the spatial co-occurrence of histogram pa...
Jianguo Li, Weixin Wu, Tao Wang, Yimin Zhang
ASC
2010
13 years 9 months ago
Genotype representations in grammatical evolution
Grammatical evolution (GE) is a form of grammar-based genetic programming. A particular feature of GE is that it adopts a distinction between the genotype and phenotype similar to...
Jonatan Hugosson, Erik Hemberg, Anthony Brabazon, ...
AAAI
2007
13 years 11 months ago
Learning Voting Trees
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffre...
TIP
2008
219views more  TIP 2008»
13 years 8 months ago
Binary Partition Trees for Object Detection
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
Verónica Vilaplana, Ferran Marqués, ...
TCAD
1998
161views more  TCAD 1998»
13 years 8 months ago
Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functions
— Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalizat...
Rolf Drechsler, Bernd Becker