Sciweavers

6142 search results - page 303 / 1229
» The Complexity of Partition Functions
Sort
View
LACL
2005
Springer
16 years 3 days ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 12 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
DOCENG
2003
ACM
15 years 12 months ago
Using SVG as the rendering model for structured and graphically complex web material
This paper reports some experiments in using SVG (Scalable Vector Graphics), rather than the browser default of (X)HTML/CSS, as a potential Web-based rendering technology, in an a...
Julius C. Mong, David F. Brailsford
BIRTHDAY
2003
Springer
15 years 12 months ago
On the Pagination of Complex Documents
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
Anne Brüggemann-Klein, Rolf Klein, Stefan Woh...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 11 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain