Sciweavers

990 search results - page 99 / 198
» Sub-Graphs of Complete Graph
Sort
View
SIAMDM
2008
119views more  SIAMDM 2008»
13 years 9 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 8 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
ICDE
2001
IEEE
159views Database» more  ICDE 2001»
14 years 10 months ago
Workflow and Process Synchronization with Interaction Expressions and Graphs
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
Christian Heinlein
ICDM
2007
IEEE
173views Data Mining» more  ICDM 2007»
14 years 3 months ago
Sparse Word Graphs: A Scalable Algorithm for Capturing Word Correlations in Topic Models
Statistical topic models such as the Latent Dirichlet Allocation (LDA) have emerged as an attractive framework to model, visualize and summarize large document collections in a co...
Ramesh Nallapati, Amr Ahmed, William W. Cohen, Eri...
ER
2004
Springer
79views Database» more  ER 2004»
14 years 2 months ago
Multi-phase Process Mining: Building Instance Graphs
Abstract. Deploying process-driven information systems is a time-consuming and error-prone task. Process mining attempts to improve this by automatically generating a process model...
Boudewijn F. van Dongen, Wil M. P. van der Aalst