Sciweavers

4137 search results - page 625 / 828
» On the number of matchings of a tree
Sort
View
CIKM
1994
Springer
14 years 8 days ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
FSTTCS
1993
Springer
14 years 8 days ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
FOCS
1992
IEEE
14 years 8 days ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo
BIRTHDAY
2007
Springer
14 years 5 days ago
Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms
Abstract. The Operational Transformation (OT) approach is a technique for supporting optimistic replication in collaborative and mobile systems. It allows the users to concurrently...
Abdessamad Imine, Michaël Rusinowitch
DOCENG
2007
ACM
14 years 3 days ago
Speculative document evaluation
Optimisation of real world Variable Data printing (VDP) documents is a difficult problem because the interdependencies between layout functions may drastically reduce the number o...
Alexander J. Macdonald, David F. Brailsford, Steve...