Sciweavers

1538 search results - page 194 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
16 years 1 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor
IPPS
1998
IEEE
15 years 5 months ago
Meta-heuristics for Circuit Partitioning in Parallel Test Generation
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
Consolación Gil, Julio Ortega, Antonio F. D...
SIGOPS
2010
162views more  SIGOPS 2010»
14 years 12 months ago
Visual and algorithmic tooling for system trace analysis: a case study
Despite advances in the application of automated statistical and machine learning techniques to system log and trace data there will always be a need for human analysis of machine...
Wim De Pauw, Steve Heisig
IDEAL
2007
Springer
15 years 7 months ago
PINCoC : A Co-clustering Based Approach to Analyze Protein-Protein Interaction Networks
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
Clara Pizzuti, Simona E. Rombo
LICS
1990
IEEE
15 years 5 months ago
Model-Checking for Real-Time Systems
E cient automatic model checking algorithms for real-time systems have been obtained in recent years based on the state region graph technique of Alur, Courcoubetis and Dill. Howev...
Rajeev Alur, Costas Courcoubetis, David L. Dill