Sciweavers

1964 search results - page 108 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
KSEM
2009
Springer
14 years 2 months ago
An Anytime Algorithm for Computing Inconsistency Measurement
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
IJSI
2010
84views more  IJSI 2010»
13 years 6 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...
CADE
1999
Springer
14 years 6 days ago
A dynamic programming approach to categorial deduction
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
Philippe de Groote
PAKDD
2010
ACM
198views Data Mining» more  PAKDD 2010»
14 years 21 days ago
A Better Strategy of Discovering Link-Pattern Based Communities by Classical Clustering Methods
Abstract. The definition of a community in social networks varies with applications. To generalize different types of communities, the concept of linkpattern based community was pr...
Chen-Yi Lin, Jia-Ling Koh, Arbee L. P. Chen
BMCBI
2008
166views more  BMCBI 2008»
13 years 8 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...