Sciweavers

4488 search results - page 118 / 898
» Properties of NP-Complete Sets
Sort
View
145
Voted
ICMCS
2009
IEEE
222views Multimedia» more  ICMCS 2009»
15 years 3 months ago
3D Gaussian descriptor for 3D shape retrieval
This paper presents a new approach to 3D shape comparison and retrieval based on the computation of Gaussian transforms of the surface model on a set of points regularly distribut...
Mohamed Chaouch, Anne Verroust-Blondet
165
Voted
JAC
2008
15 years 7 months ago
Tilings and model theory
In this paper we emphasize the links between model theory and tilings. More precisely, after giving the definitions of what tilings are, we give a natural way to have an interpreta...
Alexis Ballier, Emmanuel Jeandel
ALGORITHMICA
2006
96views more  ALGORITHMICA 2006»
15 years 6 months ago
Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics
We present some fundamental structural properties for minimum length networks (known as Steiner minimum trees) interconnecting a given set of points in an environment in which edg...
Marcus Brazil, D. A. Thomas, J. F. Weng, Martin Za...
208
Voted
FAW
2010
Springer
217views Algorithms» more  FAW 2010»
15 years 4 months ago
Path Separability of Graphs
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
Emilie Diot, Cyril Gavoille
EJC
2007
15 years 6 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi