7006 search results - page 265 / 1402 » Approximation Algorithms |
123
click to vote
CSDA
2010
15 years 3 months ago
2010
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
160
click to vote
JMLR
2010
14 years 10 months ago
2010
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
117
click to vote
OPODIS
2008
15 years 5 months ago
2008
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
131
click to vote
ISAAC
2001
Springer
15 years 8 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
131
click to vote
SIAMJO
2011
14 years 10 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...