672 search results - page 118 / 135 » Lower-stretch spanning trees |
CIKM
1994
Springer
13 years 11 months ago
1994
Springer
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...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
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...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
CAAN
2006
Springer
13 years 11 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
IEAAIE
1995
Springer
13 years 11 months ago
1995
Springer
High level Petri Nets have recently been used for many AI applications, particularly for modelling traditional rule-based expert systems. The major effect is to facilitate the ana...