4536 search results - page 373 / 908 » Contention-Sensitive Data Structures and Algorithms |
191
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
173
click to vote
PVLDB
2010
15 years 5 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
209
click to vote
ICGI
2010
Springer
15 years 4 months ago
2010
Springer
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
168
click to vote
CGF
1999
15 years 6 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
362
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...