Sciweavers

2487 search results - page 355 / 498
» Partitions of Graphs into Trees
Sort
View
WIA
2009
Springer
14 years 25 days ago
On Extremal Cases of Hopcroft's Algorithm
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...
Giusi Castiglione, Antonio Restivo, Marinella Scio...
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
14 years 18 days ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
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...
Abdel Ejnioui, N. Ranganathan
APPINF
2003
13 years 9 months ago
Corner-First Tree-based Region Broadcasting in Mesh Networks
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...
Hadeel Haddad, Muhammad F. Mudawwar
VMV
2001
132views Visualization» more  VMV 2001»
13 years 9 months ago
Optimal Memory Constrained Isosurface Extraction
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
Dietmar Saupe, Jürgen Toelke
WSCG
2004
152views more  WSCG 2004»
13 years 9 months ago
Interactive Solid Texturing using Point-based Multiresolution Representations
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...
Patrick Reuter, Benjamin Schmitt, Christophe Schli...