2680 search results - page 95 / 536 » The topology of the independence complex |
108
click to vote
ACL
2010
14 years 11 months ago
2010
Hierarchical HMM (HHMM) parsers make promising cognitive models: while they use a bounded model of working memory and pursue incremental hypotheses in parallel, they still achieve...
102
click to vote
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
15 years 8 months ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
100
click to vote
HICSS
2006
IEEE
15 years 7 months ago
2006
IEEE
Within the public sector, the deployment of enterprise architecture is often an attempt to address the decentralization/centralization relationships to improve the links between t...
110
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
108
click to vote
MFCS
1997
Springer
15 years 5 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...