Sciweavers

1648 search results - page 173 / 330
» On the generation of bicliques of a graph
Sort
View
ICIAP
2003
ACM
14 years 2 months ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar
RTCSA
2000
IEEE
14 years 1 months ago
Extracting safe and precise control flow from binaries
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
Henrik Theiling
IV
1999
IEEE
198views Visualization» more  IV 1999»
14 years 1 months ago
A Prototype Hotel Browsing System Using Java3D
Java3D is an application-centred approach to building 3D worlds. We use Java3D and VRML to design a prototype WWW-based 3D Hotel Browsing system. A Java3D scene graph viewer was i...
D. Ball, Majid Mirmehdi
IPPS
1998
IEEE
14 years 1 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
ICCAD
1994
IEEE
104views Hardware» more  ICCAD 1994»
14 years 1 months ago
Module selection and data format conversion for cost-optimal DSP synthesis
In high level synthesis each node of a synchronous dataflow graph (DFG) is scheduled to a specific time and allocated to a processor. In this paper we present new integer linear p...
Kazuhito Ito, Lori E. Lucke, Keshab K. Parhi