1149 search results - page 115 / 230 » Minimally non-Pfaffian graphs |
203
click to vote
TIT
2008
15 years 6 months ago
2008
We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...
182
click to vote
TCAD
2008
15 years 6 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
157
click to vote
TALG
2008
15 years 6 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
171
click to vote
CGF
2000
15 years 6 months ago
2000
We describe the Scene-Graph-As-Bus technique (SGAB), the first step in a staircase of solutions for sharing software components for virtual environments. The goals of SGAB are to ...
163
click to vote
DAM
2007
15 years 6 months ago
2007
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...