Sciweavers

1425 search results - page 165 / 285
» Beyond Dependency Graphs
Sort
View
AIRWEB
2005
Springer
14 years 1 months ago
Pagerank Increase under Different Collusion Topologies
We study the impact of collusion –nepotistic linking– in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probability...
Ricardo A. Baeza-Yates, Carlos Castillo, Vicente L...
IICS
2005
Springer
14 years 1 months ago
Distributed Calculation of PageRank Using Strongly Connected Components
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated c...
Michael Brinkmeier
ICDAR
2003
IEEE
14 years 1 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
ASAP
1997
IEEE
139views Hardware» more  ASAP 1997»
14 years 14 days ago
Buffer size optimization for full-search block matching algorithms
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
Yuan-Hau Yeh, Chen-Yi Lee
VLSID
1994
IEEE
113views VLSI» more  VLSID 1994»
14 years 10 days ago
A Methodology for Architecture Synthesis of Cascaded IIR Filters on TLU FPGAs
In this paper, we propose an architecture synthesis methodolog `to realize cascaded Infinite Impulse Response (IIRJfilter in Table Look Up (TLU) Field Progmmmable Gate A m y s (FP...
G. N. Rathna, S. K. Nandy, K. Parthasarathy