3894 search results - page 550 / 779 » Approximation Algorithms for Biclustering Problems |
126
click to vote
ECCC
2006
15 years 4 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
139
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
154
click to vote
ICFCA
2009
Springer
15 years 10 months ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
155
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
142
Voted
AVSS
2008
IEEE
15 years 10 months ago
2008
IEEE
Tracking humans in an indoor environment is an essential part of surveillance systems. Vision based and microphone array based trackers have been extensively researched in the pas...