3471 search results - page 164 / 695 » Obstacle Numbers of Graphs |
130
click to vote
IMCSIT
2010
15 years 2 months ago
2010
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...
167
click to vote
SAC
2008
ACM
15 years 4 months ago
2008
ACM
A major obstacle that decreases the performance of text classifiers is the extremely high dimensionality of text data. To reduce the dimension, a number of approaches based on rou...
138
Voted
CORR
2006
Springer
15 years 4 months ago
2006
Springer
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...
123
Voted
CG
2007
Springer
15 years 4 months ago
2007
Springer
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...
127
Voted
JGT
2007
15 years 4 months ago
2007
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...