Sciweavers

731 search results - page 41 / 147
» Reductions to Graph Isomorphism
Sort
View
JAIR
2011
84views more  JAIR 2011»
13 years 3 months ago
Evaluating Temporal Graphs Built from Texts via Transitive Reduction
Temporal information has been the focus of recent attention in information extraction, leading to some standardization effort, in particular for the task of relating events in a t...
Xavier Tannier, Philippe Muller
CAISE
1999
Springer
14 years 29 days ago
Applying Graph Reduction Techniques for Identifying Structural Conflicts in Process Models
Abstract. The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specificati...
Wasim Sadiq, Maria E. Orlowska
IJON
2010
121views more  IJON 2010»
13 years 6 months ago
Sample-dependent graph construction with application to dimensionality reduction
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
Bo Yang, Songcan Chen
FOCI
2007
IEEE
14 years 3 months ago
A New Reduction from 3SAT to n-Partite Graphs
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
Daniel J. Hulme, Robin Hirsch, Bernard F. Buxton, ...
AGTIVE
2003
Springer
14 years 1 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman