3433 search results - page 391 / 687 » Heuristics for a bidding problem |
162
Voted
IPL
2011
15 years 1 months ago
2011
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
265
click to vote
JMLR
2010
15 years 1 months ago
2010
Discovering the dependencies among the variables of a domain from examples is an important problem in optimization. Many methods have been proposed for this purpose, but few large...
182
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
296
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...
168
click to vote
INFOCOM
2006
IEEE
16 years 25 days ago
2006
IEEE
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...