Sciweavers

1617 search results - page 91 / 324
» Constraints in Weighted Averaging
Sort
View
NIPS
2003
15 years 7 months ago
Salient Boundary Detection using Ratio Contour
This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real image...
Song Wang, Toshiro Kubota, Jeffrey Mark Siskind
ALGORITHMICA
2010
147views more  ALGORITHMICA 2010»
15 years 6 months ago
Note on the Structure of Kruskal's Algorithm
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
Nicolas Broutin, Luc Devroye, Erin McLeish
ICIP
2009
IEEE
15 years 4 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...
IJAHUC
2011
121views more  IJAHUC 2011»
15 years 1 months ago
An interference and load aware routing metric for Wireless Mesh Networks
: This paper proposes a load and interference-aware routing metric for wireless mesh networks, named Channel Utilisation and Contention Window Based (C2WB) metric. Our metric assig...
Lan Tien Nguyen, Razvan Beuran, Yoichi Shinoda
IEEEPACT
2003
IEEE
15 years 11 months ago
Constraint Graph Analysis of Multithreaded Programs
This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions fo...
Harold W. Cain, Mikko H. Lipasti, Ravi Nair