Sciweavers

675 search results - page 94 / 135
» On Compression of Parse Trees
Sort
View
CVPR
2009
IEEE
2452views Computer Vision» more  CVPR 2009»
15 years 4 months ago
CHoG: Compressed Histogram of Gradients: A Low Bit-Rate Feature Descriptor
Establishing visual correspondences is an essential component of many computer vision problems, and is often done with robust, local feature-descriptors. Transmission and storag...
Vijay Chandrasekhar (Stanford University), Gabriel...
SIGMOD
1999
ACM
110views Database» more  SIGMOD 1999»
14 years 1 months ago
Multi-dimensional Selectivity Estimation Using Compressed Histogram Information
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...
Ju-Hong Lee, Deok-Hwan Kim, Chin-Wan Chung
CP
2007
Springer
14 years 2 months ago
A Compression Algorithm for Large Arity Extensional Constraints
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
George Katsirelos, Toby Walsh
EVOW
2007
Springer
14 years 2 months ago
Toward Greater Artistic Control for Interactive Evolution of Images and Animation
We present several practical improvements to the interactive evolution of 2D images, some of which are also applicable to more general genetic programming problems. We introduce tr...
David A. Hart
LACL
2005
Springer
14 years 2 months ago
Strict Deterministic Aspects of Minimalist Grammars
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
John T. Hale, Edward P. Stabler