Sciweavers

606 search results - page 94 / 122
» Complexity Results for Checking Distributed Implementability
Sort
View
120
Voted
ICDAR
2005
IEEE
15 years 7 months ago
Unconstrained Numeral Pair Recognition Using Enhanced Error Correcting Output Coding: A Holistic Approach
– This paper describes a new approach to recognize touching numeral strings. Currently most methods for numeral string recognition require segmenting the string image into separa...
Jie Zhou, Ching Y. Suen
EUROPAR
2005
Springer
15 years 7 months ago
Tolerating Message Latency Through the Early Release of Blocked Receives
Large message latencies often lead to poor performance of parallel applications. In this paper, we investigate a latency-tolerating technique that immediately releases all blocking...
Jian Ke, Martin Burtscher, William Evan Speight
GCC
2005
Springer
15 years 7 months ago
A Mathematical Foundation for Topology Awareness of P2P Overlay Networks
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
Habib Rostami, Jafar Habibi
EUROPAR
2003
Springer
15 years 7 months ago
Why Not Use a Pattern-Based Parallel Programming System?
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
John Anvik, Jonathan Schaeffer, Duane Szafron, Kai...
ISN
1994
Springer
136views Communications» more  ISN 1994»
15 years 5 months ago
High-Level Access APIs in the OSIMIS TMN Platform: Harnessing and Hiding
There is a common unjustified belief that OSI management technology, despite being very powerful, is difficult to implement because of the complexity of the underlying service/prot...
George Pavlou, Thurain Tin, Andy Carr