1710 search results - page 55 / 342 » Parallelism in Structured Newton Computations |
PODC
2010
ACM
14 years 18 days ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
DEBS
2010
ACM
13 years 3 months ago
2010
ACM
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
IPPS
1998
IEEE
14 years 29 days ago
1998
IEEE
Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) inde...
ISORC
2000
IEEE
14 years 1 months ago
2000
IEEE
The decomposition of large systems into parts is a general principle of software design. Even more, in the scope of distributed systems a partition of the whole system into distri...