Sciweavers

774 search results - page 52 / 155
» A New Graph Triconnectivity Algorithm and Its Parallelizatio...
Sort
View
PPOPP
2009
ACM
14 years 10 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
13 years 7 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
PPSC
1993
13 years 11 months ago
Parallel Preconditioning and Approximate Inverses on the Connection Machine
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
Marcus J. Grote, Horst D. Simon
DASFAA
2010
IEEE
139views Database» more  DASFAA 2010»
14 years 5 months ago
Highly Scalable Multiprocessing Algorithms for Preference-Based Database Retrieval
Abstract. Until recently algorithms continuously gained free performance improvements due to ever increasing processor speeds. Unfortunately, this development has reached its limit...
Joachim Selke, Christoph Lofi, Wolf-Tilo Balke
IWCIA
2004
Springer
14 years 3 months ago
Integral Trees: Subtree Depth and Diameter
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo