Sciweavers

12265 search results - page 185 / 2453
» Knuth-Morris-Pratt Algorithm: An Analysis
Sort
View
ICDAR
2003
IEEE
15 years 10 months ago
An Evolutionary Algorithm for General Symbol Segmentation
A new system is presented for general symbol segmentation, which is applicable for segmentation of any connected string of symbols, including characters and line diagrams. Using a...
Stephen Pearce, Maher Ahmed
RTSS
2002
IEEE
15 years 9 months ago
End-to-end Fairness Analysis of Fair Queuing Networks
In this paper, we present the first end-to-end fairness analysis of a network of fair servers. We argue that it is difficult to extend existing single-node fairness analysis to ...
Jasleen Kaur, Harrick M. Vin
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 8 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
CAIP
1995
Springer
155views Image Analysis» more  CAIP 1995»
15 years 8 months ago
A Proposal for the Implementation of a Parallel Watershed Algorithm
In this paper a parallel implementation of a watershed algorithm is proposed. The algorithm is designed for a ring-architecture with distributed memory and a piece of shared memory...
Arnold Meijster, Jos B. T. M. Roerdink
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 4 months ago
Betweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
Shiva Kintali