7015 search results - page 154 / 1403 » Approximation algorithms for co-clustering |
SODA
2008
ACM
13 years 11 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
NIPS
2003
13 years 11 months ago
2003
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
ISCAS
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a n...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
ESA
2007
Springer
14 years 3 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...