Sciweavers

13603 search results - page 3 / 2721
» On the Complexity of Computing Treelength
Sort
View
ACL
2010
13 years 5 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
TVCG
2012
179views Hardware» more  TVCG 2012»
11 years 9 months ago
Parallel Computation of 2D Morse-Smale Complexes
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
Nithin Shivashankar, Senthilnathan M, Vijay Natara...
IJSI
2010
84views more  IJSI 2010»
13 years 5 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
CASES
2009
ACM
13 years 4 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
TCS
2010
13 years 5 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre