3894 search results - page 335 / 779 » Approximation Algorithms for Biclustering Problems |
181
click to vote
ESANN
2004
15 years 7 months ago
2004
The one-dimensional functional equation g(y(t)) = cg(z(t)) with known functions y and z and constant c is considered. The indeterminacies are calculated, and an algorithm for appro...
190
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
154
Voted
DATE
2006
IEEE
16 years 10 days ago
2006
IEEE
The energy-aware design for electronic systems has been an important issue in hardware and/or software implementations, especially for embedded systems. This paper targets a synth...
173
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
151
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...