28095 search results - page 86 / 5619 » D |
119
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
153
Voted
SMI
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we describe a method of shape-based 3D model retrieval that employs a set of 3D, local, multi-scale features extracted from a voxel representation of a 3D model to ...
113
click to vote
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
15 years 10 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
105
click to vote
ICMCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we describe a new framework for watermarking 3D objects via their contour information. Unlike most conventional 3D object watermarking techniques, for which both in...
127
click to vote
ICMCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We introduce a novel method for three-dimensional metamorphosis between two polyhedral objects with different topologies. The 3D objects are represented as multiple 2D images and ...