937 search results - page 103 / 188 » On the Complexity of Partial Order Properties |
150
click to vote
SSDBM
2010
IEEE
15 years 11 months ago
2010
IEEE
We present a technique for organizing data in spatial databases with non-convex domains based on an automatic characterization using the medial-axis transform (MAT). We define a t...
247
click to vote
SIGSOFT
2011
ACM
15 years 1 months ago
2011
ACM
Developing complex distributed systems is a non-trivial task. It is even more difficult when the systems need to dynamically reconfigure the distributed functionalities or tasks...
193
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
169
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
171
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...