Sciweavers

2168 search results - page 207 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
138
Voted
PCI
2005
Springer
15 years 9 months ago
Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
Gunu Jho, Moonseong Kim, Hyunseung Choo
170
Voted
RANDOM
2001
Springer
15 years 8 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
130
Voted
ICIP
1995
IEEE
16 years 5 months ago
A multiresolution approach to color image restoration and parameter estimation using homotopy continuation method
In this paper, we address the problem of color image restoration. Here, we model the image as a Markov Random Field (MRF) and propose a restoration algorithm in a multiresolution ...
P. K. Nanda, K. Sunil Kumar, S. Ghokale, Uday B. D...
109
Voted
ICCCN
2007
IEEE
15 years 10 months ago
Interleaving Techniques for W-CDMA Linear Equalization Receivers
—This paper focuses on the use of specific interleaving techniques for use in W-CDMA (Wideband Code Division Multiple Access). The linear equalization algorithm usually performs ...
João Carlos Silva, Rui Dinis, Nuno Souto, F...
115
Voted
JSAT
2008
85views more  JSAT 2008»
15 years 3 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren