1772 search results - page 188 / 355 » Classifying Problems into Complexity Classes |
123
Voted
IJCAI
2003
15 years 2 months ago
2003
In this paper we address the problem of query answering and rewriting in global-as-view data integration systems, when key and inclusion dependencies are expressed on the global i...
105
Voted
UAI
2003
15 years 2 months ago
2003
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
115
Voted
CORR
2007
Springer
15 years 24 days ago
2007
Springer
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
128
click to vote
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
120
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...