3894 search results - page 163 / 779 » Approximation Algorithms for Biclustering Problems |
164
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
170
click to vote
CCR
2006
15 years 6 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
164
click to vote
JAT
2010
15 years 4 months ago
2010
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...
183
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
161
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...