Sciweavers

354 search results - page 51 / 71
» The Chromatic Number Of Graph Powers
Sort
View
TPDS
2008
96views more  TPDS 2008»
14 years 9 months ago
Stochastic Graph Processes for Performance Evaluation of Content Delivery Applications in Overlay Networks
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
CSL
2008
Springer
14 years 11 months ago
Pure Pointer Programs with Iteration
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
Martin Hofmann, Ulrich Schöpp
ICIP
2009
IEEE
14 years 7 months ago
Markovian clustering for the non-local means image denoising
The non-local means filter is one of powerful denoising methods which allows participation of far, but proper pixels in the denoising process. Although the weights of non-similar ...
Rachid Hedjam, Reza Farrahi Moghaddam, Mohamed Che...
CMOT
2004
141views more  CMOT 2004»
14 years 9 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
65
Voted
ISLPED
1997
ACM
83views Hardware» more  ISLPED 1997»
15 years 1 months ago
A symbolic algorithm for low-power sequential synthesis
We present an algorithm that restructures the state transition graph STG of a sequential circuit so as to reduce power dissipation. The STG is modi ed without changing the behav...
Balakrishna Kumthekar, In-Ho Moon, Fabio Somenzi