Sciweavers

6437 search results - page 227 / 1288
» Parallel Algorithms for Arrangements
Sort
View
CN
2008
108views more  CN 2008»
15 years 3 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
141
Voted
LICS
2010
IEEE
15 years 1 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe
EUROPAR
2010
Springer
15 years 4 months ago
Estimating and Exploiting Potential Parallelism by Source-Level Dependence Profiling
Manual parallelization of programs is known to be difficult and error-prone, and there are currently few ways to measure the amount of potential parallelism in the original sequent...
Jonathan Mak, Karl-Filip Faxén, Sverker Jan...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 3 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
108
Voted
IPPS
2002
IEEE
15 years 8 months ago
Distribution Sweeping on Clustered Machines with Hierarchical Memories
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered ...
Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pie...