Sciweavers

620 search results - page 38 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
ICPP
2006
IEEE
16 years 28 days ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
SASO
2007
IEEE
16 years 1 months ago
Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling
The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in wireless networks to models of fireflies flashing in...
Ankit Patel, Julius Degesys, Radhika Nagpal
VLSM
2005
Springer
16 years 11 days ago
Heuristically Driven Front Propagation for Geodesic Paths Extraction
In this paper we present a simple modification of the Fast Marching algorithm to speed up the computation using a heuristic. This modification leads to an algorithm that is simil...
Gabriel Peyré, Laurent D. Cohen
189
Voted
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
15 years 8 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel
SIGIR
1998
ACM
15 years 11 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...