1064 search results - page 48 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
114
click to vote
APPML
2007
15 years 4 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
127
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
132
click to vote
JMLR
2006
15 years 3 months ago
2006
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
153
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
134
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...