14190 search results - page 2820 / 2838 » computer 2008 |
ESA
2008
Springer
14 years 21 days ago
2008
Springer
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
ESA
2008
Springer
14 years 21 days ago
2008
Springer
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
ESORICS
2008
Springer
14 years 21 days ago
2008
Springer
We are interested in this problem: a verifier, with a small and reliable storage, wants to periodically check whether a remote server is keeping a large file x. A dishonest server,...
ESORICS
2008
Springer
14 years 21 days ago
2008
Springer
Abstract. Identity fraud (IDF) may be defined as unauthorized exploitation of credential information through the use of false identity. We propose CROO, a universal (i.e. generic) ...
ESWS
2008
Springer
14 years 21 days ago
2008
Springer
: The mathematical nature of description logics has meant that domain experts find them hard to understand. This forms a significant impediment to the creation and adoption of onto...