3894 search results - page 593 / 779 » Approximation Algorithms for Biclustering Problems |
124
Voted
TPDS
2008
15 years 3 months ago
2008
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
135
Voted
TIP
1998
15 years 3 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
129
Voted
TKDE
2010
15 years 2 months ago
2010
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
149
Voted
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
133
Voted
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...