3894 search results - page 633 / 779 » Approximation Algorithms for Biclustering Problems |
116
click to vote
SODA
2007
ACM
15 years 4 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
115
Voted
IJCAI
1997
15 years 4 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
126
Voted
PODS
2010
ACM
15 years 3 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
157
Voted
COMCOM
2010
15 years 3 months ago
2010
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
150
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...