1064 search results - page 94 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
165
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
132
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
260
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
137
click to vote
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
148
click to vote
MP
2002
15 years 3 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...