72 search results - page 5 / 15 » Generation of Oriented Matroids - A Graph Theoretical Approa... |
147
click to vote
ENDM
2010
15 years 4 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
134
Voted
ACSC
2003
IEEE
15 years 9 months ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
212
click to vote
BALT
2010
14 years 11 months ago
2010
For the purposes of tool development, computer languages are usually described using context-free grammars with annotations such as semantic actions or pretty-printing instructions...
143
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
122
click to vote
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...