Sciweavers

2780 search results - page 132 / 556
» Generalizing by Removing Detail
Sort
View
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 10 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
COMPSAC
2004
IEEE
15 years 10 months ago
Software Reliability Growth Models Incorporating Fault Dependency with Various Debugging Time Lags
Software reliability is defined as the probability of failure-free software operation for a specified period of time in a specified environment. Over the past 30 years, many softw...
Chin-Yu Huang, Chu-Ti Lin, Sy-Yen Kuo, Michael R. ...
CGO
2003
IEEE
15 years 10 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
ACSD
2009
IEEE
106views Hardware» more  ACSD 2009»
15 years 8 months ago
Specification Enforcing Refinement for Convertibility Verification
Protocol conversion deals with the automatic synthesis of an additional component, often referred to as an adaptor or a converter, to bridge mismatches between interacting compone...
Partha S. Roop, Alain Girault, Roopak Sinha, Grego...
ECCC
2007
124views more  ECCC 2007»
15 years 6 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler