1139 search results - page 168 / 228 » Bounded Ideation Theory |
123
click to vote
SEMWEB
2005
Springer
15 years 10 months ago
2005
Springer
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...
121
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
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...
140
click to vote
SIGECOM
2004
ACM
15 years 10 months ago
2004
ACM
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 ...
121
click to vote
ASIACRYPT
2004
Springer
15 years 9 months ago
2004
Springer
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...
141
click to vote
CC
2004
Springer
15 years 9 months ago
2004
Springer
In theory, increasing alias analysis precision should improve compiler optimizations on C programs. This paper compares alias analysis algorithms on scalar optimizations, including...