Sciweavers

4112 search results - page 1 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
FUN
2007
Springer
85views Algorithms» more  FUN 2007»
14 years 2 months ago
Efficient Algorithms for the Spoonerism Problem
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ri...
ECCV
2010
Springer
13 years 8 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...
TALG
2010
93views more  TALG 2010»
13 years 5 months ago
Efficient algorithms for the 2-gathering problem
Alon Shalita, Uri Zwick
DSN
2006
IEEE
14 years 4 months ago
Improving the Fault Resilience of Overlay Multicast for Media Streaming
This paper addresses the problem of fault resilience of overlay-based live media streaming from two aspects: (1) how to construct a stable multicast tree that minimizes the negati...
Guang Tan, Stephen A. Jarvis, Daniel P. Spooner
IPPS
2003
IEEE
14 years 4 months ago
Agent-Based Grid Load Balancing Using Performance-Driven Task Scheduling
Load balancing is a key concern when developing parallel and distributed computing applications. The emergence of computational grids extends this problem, where issues of cross-d...
Junwei Cao, Daniel P. Spooner, Stephen A. Jarvis, ...