Sciweavers

2340 search results - page 155 / 468
» Copying and Comparing: Problems and Solutions
Sort
View
IPPS
2000
IEEE
15 years 10 months ago
Replicating the Contents of a WWW Multimedia Repository to Minimize Download Time
Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as ...
Thanasis Loukopoulos, Ishfaq Ahmad
ICLP
1997
Springer
15 years 10 months ago
A Practical Approach to Structure Reuse of Arrays in Single Assignment Languages
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
Andreas Kågedal, Saumya K. Debray
CVIU
2011
14 years 10 months ago
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
Guillaume Damiand, Christine Solnon, Colin de la H...
EDBT
2009
ACM
108views Database» more  EDBT 2009»
15 years 11 months ago
Reverse k-nearest neighbor search in dynamic and general metric databases
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
Elke Achtert, Hans-Peter Kriegel, Peer Kröger...
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
15 years 10 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang