Sciweavers

1208 search results - page 139 / 242
» On Counting Generalized Colorings
Sort
View
SPIESR
1997
143views Database» more  SPIESR 1997»
14 years 11 months ago
Similarity Evaluation in Image Retrieval Using Simple Features
The development of increasingly complex multimedia applications calls for new methodologies for the organization and retrieval of still images and video sequences. Query and retri...
Eugenio Di Sciascio, Augusto Celentano
CGF
2008
118views more  CGF 2008»
14 years 10 months ago
Manifold-valued Thin-Plate Splines with Applications in Computer Graphics
We present a generalization of thin-plate splines for interpolation and approximation of manifold-valued data, and demonstrate its usefulness in computer graphics with several app...
Florian Steinke, Matthias Hein, Jan Peters, Bernha...
79
Voted
ENDM
2007
111views more  ENDM 2007»
14 years 10 months ago
Claw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
Arnaud Pêcher, Xuding Zhu
MVA
2006
14 years 10 months ago
A System for 3D Modeling Frescoed Historical Buildings with Multispectral Texture Information
Abstract This work proposes a system for the automatic construction of multi-spectral three-dimensional (3D) models of architecture. Besides the specific application, which concern...
Nicola Brusco, S. Capeleto, M. Fedel, A. Paviotti,...
IANDC
2007
123views more  IANDC 2007»
14 years 10 months ago
Hardness of fully dense problems
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
Nir Ailon, Noga Alon