11151 search results - page 287 / 2231 » On the Complexity of Model Expansion |
214
click to vote
IV
2010
IEEE
15 years 5 months ago
2010
IEEE
The advent of consumer-generated and social media has led to a continuous expansion and diversification of the media landscape. Media consumers frequently find themselves assuming ...
324
click to vote
NLDB
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Linked Data brings the promise of incorporating a new dimension to the Web where the availability of Web-scale data can determine a paradigmatic transformation of the Web...
199
click to vote
EMNLP
2011
14 years 7 months ago
2011
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
165
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
198
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...