Sciweavers

5329 search results - page 78 / 1066
» The Weighted Majority Algorithm
Sort
View
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
14 years 2 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
WIA
2004
Springer
14 years 2 months ago
A General Weighted Grammar Library
We present a general weighted grammar software library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. The underlying a...
Cyril Allauzen, Mehryar Mohri, Brian Roark
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
13 years 9 months ago
A New Table of Constant Weight Codes of Length Greater than 28
Existing tables of constant weight codes are mainly confined to codes of length n 28. This paper presents tables of codes of lengths 29 n 63. The motivation for creating these ...
Derek H. Smith, L. A. Hughes, Stephanie Perkins
NETWORKS
2008
13 years 9 months ago
A linear programming approach to increasing the weight of all minimum spanning trees
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
Mourad Baïou, Francisco Barahona
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 10 months ago
Weighted Proximity Best-Joins for Information Retrieval
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
AnHai Doan, Haixun Wang, Hao He, Jun Yang 0001, Ri...