3894 search results - page 96 / 779 » Approximation Algorithms for Biclustering Problems |
261
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
149
click to vote
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...
161
click to vote
ICANN
2007
Springer
16 years 13 days ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
193
click to vote
CIARP
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
157
click to vote
IAT
2006
IEEE
16 years 10 days ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...