Sciweavers

1139 search results - page 168 / 228
» Bounded Ideation Theory
Sort
View
SEMWEB
2005
Springer
14 years 1 months ago
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
Herman J. ter Horst
COMPGEOM
2004
ACM
14 years 1 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
ASIACRYPT
2004
Springer
14 years 1 months ago
Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
CC
2004
Springer
110views System Software» more  CC 2004»
14 years 1 months ago
The Limits of Alias Analysis for Scalar Optimizations
In theory, increasing alias analysis precision should improve compiler optimizations on C programs. This paper compares alias analysis algorithms on scalar optimizations, including...
Rezaul Alam Chowdhury, Peter Djeu, Brendon Cahoon,...