Sciweavers

1029 search results - page 76 / 206
» Compact representations of ordered sets
Sort
View
102
Voted
CP
2007
Springer
15 years 8 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
SMI
2005
IEEE
111views Image Analysis» more  SMI 2005»
15 years 8 months ago
Smooth Adaptive Fitting of 3D Models Using Hierarchical Triangular Splines
The recent ability to measure quickly and inexpensively dense sets of points on physical objects has deeply influenced the way engineers used to represent shapes in CAD systems, ...
Alex Yvart, Stefanie Hahmann, Georges-Pierre Bonne...
RC
2006
88views more  RC 2006»
15 years 2 months ago
Geometric Constructions with Discretized Random Variables
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimension...
Hans-Peter Schröcker, Johannes Wallner
136
Voted
ICIP
2003
IEEE
16 years 4 months ago
Fast similarity search on video signatures
Video signatures are compact representations of video sequences designed for efficient similarity measurement. In this paper, we propose a feature extraction technique to support ...
Sen-Ching S. Cheung, Avideh Zakhor
121
Voted
ICPR
2006
IEEE
16 years 3 months ago
Latent Layout Analysis for Discovering Objects in Images
Latent Layout Analysis (LLA) is a novel unsupervised learning technique to discover objects in unseen images using a set of un-annotated training images. LLA defines a generative ...
David Liu, Datong Chen, Tsuhan Chen