Sciweavers

728 search results - page 28 / 146
» Compressing combinatorial objects
Sort
View
CSL
2007
Springer
14 years 1 months ago
Linear Realizability
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also de...
Naohiko Hoshino
ECAI
2008
Springer
13 years 9 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
13 years 8 months ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
ICIP
2005
IEEE
14 years 9 months ago
On object-based compression for a class of dynamic image-based representations
An object-based compression scheme for a class of dynamic image-based representations called "plenoptic videos" (PVs) is studied in this paper. PVs are simplified dynami...
Qing Wu, King To Ng, Shing-Chow Chan, Heung-Yeung ...
FCT
2007
Springer
14 years 1 months ago
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...