Sciweavers

530 search results - page 30 / 106
» Structural and Complexity Aspects of Line Systems of Graphs
Sort
View
140
Voted
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
15 years 6 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines
PODC
2010
ACM
15 years 3 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
106
Voted
CONCUR
2008
Springer
15 years 3 months ago
Unfolding-Based Diagnosis of Systems with an Evolving Topology
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...
Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara...
85
Voted
LREC
2010
144views Education» more  LREC 2010»
15 years 3 months ago
Evaluating Complex Semantic Artifacts
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
Christopher R. Walker, Hannah Copperman
CASCON
1993
117views Education» more  CASCON 1993»
15 years 3 months ago
Documenting-in-the-large vs. documenting-in-the-small
There is a signi cant di erence between documentinglarge programs and documenting small ones. By large programs we mean on the order of 1,000,000 lines, usually written by many di...
Scott R. Tilley