Sciweavers

19700 search results - page 67 / 3940
» DNA-Based Computation Times
Sort
View
TON
2010
158views more  TON 2010»
13 years 8 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
TCS
2010
13 years 8 months ago
Towards practical feasibility of core computation in data exchange
Abstract. Core computation in data exchange is concerned with materializing the minimal target database for a given source database. Gottlob and Nash have recently shown that the c...
Reinhard Pichler, Vadim Savenkov
COMGEO
2010
ACM
13 years 8 months ago
Computing the visibility map of fat objects
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
Mark de Berg, Chris Gray
SDMW
2010
Springer
13 years 7 months ago
Computationally Efficient Searchable Symmetric Encryption
Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little ...
Peter van Liesdonk, Saeed Sedghi, Jeroen Doumen, P...
CORR
2002
Springer
117views Education» more  CORR 2002»
13 years 9 months ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski