3894 search results - page 506 / 779 » Approximation Algorithms for Biclustering Problems |
196
Voted
IPMI
2011
Springer
14 years 7 months ago
2011
Springer
This paper proposes a novel method for computing linear basis images from tensor-valued image data. As a generalization of the nonnegative matrix factorization, the proposed method...
119
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
155
Voted
CP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
127
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the ...
148
Voted
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...