3894 search results - page 367 / 779 » Approximation Algorithms for Biclustering Problems |
175
click to vote
DISOPT
2008
15 years 5 months ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
138
click to vote
PKDD
2010
Springer
15 years 3 months ago
2010
Springer
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
159
click to vote
ISMIR
2005
Springer
15 years 10 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
155
click to vote
ICDCS
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
123
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...