Sciweavers

394 search results - page 57 / 79
» Testing subgraphs in large graphs
Sort
View
CPHYSICS
2006
124views more  CPHYSICS 2006»
13 years 7 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
14 years 2 months ago
Permuting Web Graphs
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
ICMLA
2008
13 years 9 months ago
Graph-Based Multilevel Dimensionality Reduction with Applications to Eigenfaces and Latent Semantic Indexing
Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. Thi...
Sophia Sakellaridi, Haw-ren Fang, Yousef Saad
WCRE
2003
IEEE
14 years 1 months ago
GUI Ripping: Reverse Engineering of Graphical User Interfaces for Testing
Graphical user interfaces (GUIs) are important parts of today’s software and their correct execution is required to ensure the correctness of the overall software. A popular tec...
Atif M. Memon, Ishan Banerjee, Adithya Nagarajan
MBEES
2008
13 years 9 months ago
Composition of Model-based Test Coverage Criteria
: In this paper, we discuss adjustable coverage criteria and their combinations in model-based testing. We formalize coverage criteria and specify test goals using OCL. Then, we pr...
Mario Friske, Bernd-Holger Schlingloff, Stephan We...