3894 search results - page 427 / 779 » Approximation Algorithms for Biclustering Problems |
143
click to vote
ICDCS
2009
IEEE
15 years 11 months ago
2009
IEEE
The usage of network resources by content providers is commonly governed by Service Level Agreements (SLA) between the content provider and the network service provider. Resource ...
141
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
153
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
108
click to vote
NIPS
2003
15 years 6 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
138
click to vote
COMBINATORICA
2007
15 years 4 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...