2487 search results - page 355 / 498 » Partitions of Graphs into Trees |
139
click to vote
WIA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
137
Voted
FPGA
1999
ACM
15 years 7 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
131
Voted
APPINF
2003
15 years 4 months ago
2003
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
153
Voted
VMV
2001
15 years 4 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
140
Voted
WSCG
2004
15 years 4 months ago
2004
This paper presents an interactive environment for texturing surfaces of arbitrary 3D objects. By uniquely using solid textures and applying them to the surface, we do not require...