1091 search results - page 178 / 219 » Approximation Algorithms for Data Placement Problems |
AAAI
2010
13 years 9 months ago
2010
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
BMCBI
2006
13 years 8 months ago
2006
Background: An important class of interaction switches for biological circuits and disease pathways are short binding motifs. However, the biological experiments to find these bin...