324views more  TVCG 2008»
13 years 6 months ago
Curve-Skeleton Extraction Using Iterative Least Squares Optimization
A curve skeleton is a compact representation of 3D objects and has numerous applications. It can be used to describe an object's geometry and topology. In this paper, we intro...
Yu-Shuen Wang, Tong-Yee Lee
145views more  JAIR 2008»
13 years 7 months ago
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
Sylvain Bouveret, Jérôme Lang
124views more  AICOM 2006»
13 years 7 months ago
A Compact Representation for Least Common Subsumers in the description logic ALE
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
107views more  CGF 2010»
13 years 7 months ago
Geometry-Driven Local Neighbourhood Based Predictors for Dynamic Mesh Compression
The task of dynamic mesh compression seeks to find a compact representation of a surface animation, while the artifacts introduced by the representation are as small as possible. ...
Libor Vása, Václav Skala
13 years 8 months ago
Motion Segmentation in Long Image Sequences
Long image sequences provide a wealth of information, which means that a compact representation is needed to efficiently process them. In this paper a novel representation for mot...
Steven Mills, Kevin Novins
13 years 8 months ago
A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments
Coalition formation is an important capability of automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered is...
Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo, Kohki M...
13 years 8 months ago
Modelling motion primitives and their timing in biologically executed movements
Biological movement is built up of sub-blocks or motion primitives. Such primitives provide a compact representation of movement which is also desirable in robotic control applica...
Ben H. Williams, Marc Toussaint, Amos J. Storkey
13 years 9 months ago
Mixed Integer Linear Programming for Exact Finite-Horizon Planning in Decentralized Pomdps
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
Raghav Aras, Alain Dutech, François Charpil...
180views Combinatorics» more  CPM 2010»
14 years 1 days ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
14 years 21 days ago
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
Christophe Crespelle, Christophe Paul