11151 search results - page 161 / 2231 » On the Complexity of Model Expansion |
141
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
218
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
173
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
180
click to vote
MOBICOM
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
159
click to vote
ICANN
2005
Springer
15 years 10 months ago
2005
Springer
Spike synchronisation and de-synchronisation are important for feature binding and separation at various levels in the visual system. We present a model of complex valued neuron ac...