4865 search results - page 331 / 973 » The Complexity of Graph Connectivity |
196
click to vote
FPL
2007
Springer
15 years 10 months ago
2007
Springer
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analys...
175
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...
168
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
185
click to vote
TROB
2008
15 years 6 months ago
2008
Abstract-- Stability analysis of decentralized control mechanisms for networked, coordinating systems has generally focused on specific controller implementations, such as nearest ...
201
click to vote
DCG
2011
15 years 1 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...