740 search results - page 63 / 148 » An approximation ratio for biclustering |
117
click to vote
AI
2011
Springer
14 years 7 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
124
Voted
ALGOSENSORS
2009
Springer
15 years 6 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
COCOON
2008
Springer
15 years 1 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
SGP
2003
15 years 1 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...