Sciweavers

3757 search results - page 181 / 752
» The overlap number of a graph
Sort
View
IMCSIT
2010
15 years 4 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko
CORR
2006
Springer
88views Education» more  CORR 2006»
15 years 6 months ago
A Graph-based Framework for Transmission of Correlated Sources over Broadcast Channels
Abstract-- In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for thi...
Suhan Choi, S. Sandeep Pradhan
CG
2007
Springer
15 years 6 months ago
Graphtracker: A topology projection invariant optical tracker
In this paper, we describe a new optical tracking algorithm for pose estimation of interaction devices in virtual and augmented reality. Given a 3D model of the interaction device...
Ferdi A. Smit, Arjen van Rhijn, Robert van Liere
JGT
2007
68views more  JGT 2007»
15 years 6 months ago
Forcing highly connected subgraphs
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
Maya Jakobine Stein
DATE
2009
IEEE
102views Hardware» more  DATE 2009»
16 years 1 months ago
Register placement for high-performance circuits
—In modern sub-micron design, achieving low-skew clock distributions is facing challenges for high-performance circuits. Symmetric global clock distribution and clock tree synthe...
Mei-Fang Chiang, Takumi Okamoto, Takeshi Yoshimura