Sciweavers

9871 search results - page 132 / 1975
» On the Structure of Low Sets
Sort
View
ECAI
2010
Springer
15 years 7 months ago
On Testing Answer-Set Programs
Answer-set programming (ASP) is a well-acknowledged paradigm for declarative problem solving, yet comparably little effort has been spent on the investigation of methods to support...
Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch...
ICMLA
2009
15 years 4 months ago
Learning Probabilistic Structure Graphs for Classification and Detection of Object Structures
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
Johannes Hartz
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
16 years 8 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
JMLR
2010
113views more  JMLR 2010»
15 years 1 months ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...
COLOGNETWENTE
2007
15 years 7 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg