Sciweavers

2555 search results - page 16 / 511
» Putting complex systems to work
Sort
View
ENTCS
2006
113views more  ENTCS 2006»
13 years 9 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 2 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
CA
1999
IEEE
14 years 2 months ago
Collaborative Animation over the Network
The continuously increasing complexity of computer animationsmakes it necessary to rely on the knowledge of various experts to cover the different areas of computer graphics and a...
François Faure, Chris Faisstnauer, Gerd Hes...
JFPLC
1998
13 years 11 months ago
DF - a feature constraint system and its extension to a logic concurrent language
Abstract. This paper presents a feature constraint system that, compared with the well-known systems OSF 1] and CFT 5], incorporates several interesting characteristics. The new sy...
Liviu-Virgil Ciortuz
CADUI
2006
13 years 11 months ago
Towards A System Of Patterns For The Design Of Multimodal Interfaces
Since R. Bolt's seminal "Put that there" demonstrator, more and more robust and innovative modalities can be used and empirical work on the usage of multiple modalit...
Guillaume Godet-Bar, Sophie Dupuy-Chessa, Laurence...