3368 search results - page 351 / 674 » The Complexity of Query Reliability |
189
click to vote
PPSWR
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. In this paper we define the basic concepts for a general language for evolution and reactivity in the Semantic Web. We do this by exposing an UML model that specifies a...
153
click to vote
STACS
2005
Springer
16 years 3 days ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
155
Voted
ESA
2004
Springer
16 years 1 days ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
157
click to vote
SDMW
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. A new simple and efficient database encryption scheme is presented. The new scheme enables encrypting the entire content of the database without changing its structure. I...
164
click to vote
GCC
2003
Springer
15 years 12 months ago
2003
Springer
Management of various complex resources is an important issue to be well done, in order to fulfill the potential of Grid. In this paper, we propose a formal data model and algebra ...