Sciweavers

3220 search results - page 232 / 644
» Constrained Graph Processes
Sort
View
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
15 years 8 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
BXML
2003
15 years 8 months ago
Towards Automatic Selection of Web Services Using Graph Transformation Rules
: The Web service architecture promises to be highly dynamic. The idea is that a service requester can discover a needed service at runtime. Due to the fact that this discovery pro...
Jan Hendrik Hausmann, Reiko Heckel, Marc Lohmann
EDBT
2010
ACM
164views Database» more  EDBT 2010»
15 years 9 months ago
Techniques for efficiently querying scientific workflow provenance graphs
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
Manish Kumar Anand, Shawn Bowers, Bertram Ludä...
DAC
2006
ACM
16 years 7 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,...
BMCBI
2007
134views more  BMCBI 2007»
15 years 6 months ago
Benchmarking natural-language parsers for biological applications using dependency graphs
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
Andrew B. Clegg, Adrian J. Shepherd