Sciweavers

4781 search results - page 609 / 957
» Complexity at large
Sort
View
165
Voted
CADE
2004
Springer
16 years 5 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
16 years 5 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 5 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
VLDB
2007
ACM
130views Database» more  VLDB 2007»
16 years 5 months ago
A Simple and Efficient Estimation Method for Stream Expression Cardinalities
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
Aiyou Chen, Jin Cao, Tian Bu
SIGMOD
2003
ACM
115views Database» more  SIGMOD 2003»
16 years 5 months ago
Querying Structured Text in an XML Database
XML databases often contain documents comprising structured text. Therefore, it is important to integrate "information retrieval style" query evaluation, which is well-s...
Shurug Al-Khalifa, Cong Yu, H. V. Jagadish