Sciweavers

368 search results - page 37 / 74
» Higher Eigenvalues of Graphs
Sort
View
FOCS
1993
IEEE
13 years 12 months ago
Simulated Annealing for Graph Bisection
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
Mark Jerrum, Gregory B. Sorkin
CCGRID
2006
IEEE
13 years 11 months ago
Compilation of XSLT into Dataflow Graphs for Web Service Composition
Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and ...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...
ICSE
2008
IEEE-ACM
14 years 8 months ago
Predicting defects using network analysis on dependency graphs
In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience bac...
Thomas Zimmermann, Nachiappan Nagappan
AUSDM
2007
Springer
164views Data Mining» more  AUSDM 2007»
14 years 1 months ago
SemGrAM - Integrating Semantic Graphs into Association Rule Mining
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...
John F. Roddick, Peter Fule
EURODAC
1994
IEEE
129views VHDL» more  EURODAC 1994»
13 years 12 months ago
A general state graph transformation framework for asynchronous synthesis
Abstract -- A general framework for synthesis of asynchronous control circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well a...
Bill Lin, Chantal Ykman-Couvreur, Peter Vanbekberg...