1278 search results - page 118 / 256 » The Complexity of Weighted Boolean |
ICPADS
2007
IEEE
14 years 4 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
Publication
In this note, improvements to the non-local means
image denoising method introduced in [2], [3] are presented.
The original non-local means method replaces a noisy pixel by
the ...
DPPI
2007
ACM
14 years 2 months ago
2007
ACM
In this paper we introduce a novel interface for exploring dynamic equilibria using the metaphor of a traditional balance scale. Rather than comparing and identifying physical weig...
CVPR
2008
IEEE
15 years 10 days ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
ISCAS
2006
IEEE
14 years 4 months ago
2006
IEEE
— Fast QR decomposition RLS (FQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The FQRD-RLS algorithms do not provide acce...