Sciweavers

941 search results - page 26 / 189
» Efficient Testing of Large Graphs
Sort
View
69
Voted
SE
2010
14 years 11 months ago
Multi-Level Test Models for Embedded Systems
Abstract: Test methodologies for large embedded systems fail to reflect the test process as a whole. Instead, the test process is divided into independent test levels feaifferences...
Abel Marrero Pérez, Stefan Kaiser
IPPS
2010
IEEE
14 years 7 months ago
Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
Seunghwa Kang, David A. Bader
78
Voted
ICPR
2002
IEEE
15 years 10 months ago
Metric-Based Shape Retrieval in Large Databases
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
Thomas B. Sebastian, Benjamin B. Kimia
69
Voted
DAC
2006
ACM
15 years 10 months ago
Efficient simulation of critical synchronous dataflow graphs
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
Chia-Jui Hsu, José Luis Pino, Ming-Yung Ko,...
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
15 years 10 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira