5329 search results - page 201 / 1066 » The Weighted Majority Algorithm |
170
click to vote
MP
2006
15 years 6 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
149
click to vote
CN
2004
15 years 6 months ago
2004
Abstract-We investigate schemes for achieving service differentiation via weighted end-to-end congestion control mechanisms within the framework of the additive increase/multiplica...
203
click to vote
DKE
2002
15 years 6 months ago
2002
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
219
click to vote
CODCRY
2011
Springer
14 years 10 months ago
2011
Springer
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
178
click to vote
CGI
1999
IEEE
15 years 10 months ago
1999
IEEE
Existing data embedding algorithms for polygonal meshes and their attributes can't be applied to the majority of (geometric) computer aided design (CAD) applications, for two...