5329 search results - page 78 / 1066 » The Weighted Majority Algorithm |
182
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
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...
135
click to vote
WIA
2004
Springer
15 years 11 months ago
2004
Springer
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...
141
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
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 ...
179
click to vote
NETWORKS
2008
15 years 6 months ago
2008
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...
264
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
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-...