Sciweavers

5964 search results - page 216 / 1193
» A theory of speculative computation
Sort
View
COCOON
2003
Springer
16 years 12 days ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz
ECAI
2006
Springer
15 years 11 months ago
A Logic-Based Framework to Compute Pareto Agreements in One-Shot Bilateral Negotiation
Abstract. We propose a logic-based approach to automated oneshot multi-issue bilateral negotiation. We use logic in two ways: (1) a logic theory to represent relations among issues...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
DICTA
2007
15 years 8 months ago
The Tower of Knowledge Scheme for Learning in Computer Vision
A scheme, named tower of knowledge (ToK), is proposed for interpreting 3D scenes. The ToK encapsulates causal dependencies between object appearance and functionality. We demonstr...
Maria Petrou, Mai Xu
COLING
1994
15 years 8 months ago
Towards a Proper Linguistic and Computational Treatment of Scrambling: An Analysis of Japanese
t This paper describes how recent linguistic results in explaining Japanese short and long distance scram hling (:an be directly incorporated into an existing principles-and-parame...
Sandiway Pong
JAT
2010
51views more  JAT 2010»
15 years 2 months ago
Optimal adaptive computations in the Jaffard algebra and localized frames
We study the efficient numerical solution of infinite matrix equations Au = f for a matrix A in the Jaffard algebra. These matrices appear naturally via frame discretizations in m...
Stephan Dahlke, Massimo Fornasier, Karlheinz Gr&ou...