Sciweavers

5329 search results - page 83 / 1066
» The Weighted Majority Algorithm
Sort
View
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
13 years 8 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
FOCS
2010
IEEE
13 years 7 months ago
Subcubic Equivalences between Path, Matrix and Triangle Problems
We say an algorithm on n
Virginia Vassilevska Williams, Ryan Williams
ICALP
2009
Springer
14 years 9 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...
AINA
2003
IEEE
14 years 2 months ago
Fast Algorithms for Common-Multiplicand Multiplication and Exponentiation by Performing Complements
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...
Chin-Chen Chang, Ying-Tse Kuo, Chu-Hsing Lin
ICPR
2008
IEEE
14 years 3 months ago
Optimal feature weighting for the discrete HMM
We propose a modified discrete HMM that includes a feature weighting discrimination component. We assume that the feature space is partitioned into subspaces and that the relevan...
Oualid Missaoui, Hichem Frigui