Sciweavers

4926 search results - page 277 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
165
Voted
ICST
2009
IEEE
16 years 24 days ago
Optimizing Generation of Object Graphs in Java PathFinder
Java PathFinder (JPF) is a popular model checker for Java programs. JPF was used to generate object graphs as test inputs for object-oriented programs. Specifically, JPF was used...
Milos Gligoric, Tihomir Gvero, Steven Lauterburg, ...
165
Voted
CGF
2002
107views more  CGF 2002»
15 years 6 months ago
Geometric Approximations Towards Free Specular Comic Shading
We extend the standard solution to comic rendering with a comic-style specular component. To minimise the computational overhead associated with this extension, we introduce two o...
Holger Winnemöller, Shaun Bangay
164
Voted
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
15 years 10 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
VISUALIZATION
1999
IEEE
15 years 10 months ago
Image Graphs - A Novel Approach to Visual Data Exploration
For types of data visualization where the cost of producing images is high, and the relationship between the rendering parameters and the image produced is less than obvious, a vi...
Kwan-Liu Ma
160
Voted
INFOCOM
2009
IEEE
16 years 24 days ago
Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoli...