7015 search results - page 34 / 1403 » Approximation algorithms for co-clustering |
SODA
2003
ACM
13 years 10 months ago
2003
ACM
Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
NETWORKS
2006
13 years 9 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
CIAC
2000
Springer
14 years 18 days ago
2000
Springer
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
NIPS
2004
13 years 10 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...