17920 search results - page 318 / 3584 » Recentering computer science |
158
Voted
CSR
2008
Springer
15 years 8 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
154
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
158
click to vote
WG
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...
184
click to vote
SOFSEM
2004
Springer
16 years 21 hour ago
2004
Springer
Abstract. Research on processing XML documents gained much activity in recent times. XML query languages are mostly based on XPath expressions, which are used to select parts of XM...
177
click to vote
DIS
2007
Springer
15 years 10 months ago
2007
Springer
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...