Sciweavers

1722 search results - page 81 / 345
» Variables in Concept Graphs
Sort
View
VLDB
2005
ACM
82views Database» more  VLDB 2005»
15 years 3 months ago
Stack-based Algorithms for Pattern Matching on DAGs
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
Li Chen, Amarnath Gupta, M. Erdem Kurul
ISCAS
2003
IEEE
96views Hardware» more  ISCAS 2003»
15 years 3 months ago
A novel improvement technique for high-level test synthesis
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...
Saeed Safari, Hadi Esmaeilzadeh, Amir-Hossein Jaha...
ICSM
1998
IEEE
15 years 2 months ago
Improving Visual Impact Analysis
Visual impact analysis is a software visualisation technique that lets software maintainers judge the impact of proposed changes and plan maintenance accordingly. An existing CASE...
Matthew A. Hutchins, Keith Gallagher
CCE
2008
14 years 10 months ago
Structured modeling for processes: A thermodynamical network theory
We review the use of bond graphs for modeling of physico-chemical processes. We recall that bond graphs define a circuit-type language which root on a thermodynamical consistent d...
Françoise Couenne, Christian Jallut, Bernha...
CPC
2006
110views more  CPC 2006»
14 years 9 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin