Sciweavers

4118 search results - page 257 / 824
» Efficient Algorithms for Airline Problem
Sort
View
MEMICS
2010
14 years 11 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
MOBICOM
1997
ACM
15 years 8 months ago
Log-Time Algorithms for Scheduling Single and Multiple Channel Data Broadcast
With the increasing popularity of portable wireless computers, mechanisms to efficiently transmit information to such clients are of significant interest. The environmentundercons...
Sohail Hameed, Nitin H. Vaidya
JPDC
2006
111views more  JPDC 2006»
15 years 4 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
15 years 2 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo
PODC
2009
ACM
16 years 5 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...