744 search results - page 52 / 149 » Weight Multiplicities for so5(C) |
182
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
188
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
164
click to vote
JMLR
2012
13 years 8 months ago
2012
We develop a new tool for data-dependent analysis of the exploration-exploitation trade-off in learning under limited feedback. Our tool is based on two main ingredients. The fi...
177
click to vote
MP
2002
15 years 5 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
183
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...