740 search results - page 77 / 148 » Lower bounds for Buchsbaum* complexes |
163
click to vote
PVLDB
2008
15 years 5 months ago
2008
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
194
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
172
click to vote
ASIACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
160
click to vote
NIPS
2001
15 years 7 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
147
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...