Sciweavers

740 search results - page 81 / 148
» An approximation ratio for biclustering
Sort
View
JCO
2006
153views more  JCO 2006»
14 years 12 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
TCOM
2008
116views more  TCOM 2008»
14 years 11 months ago
Bounds on the Distribution of a Sum of Correlated Lognormal Random Variables and Their Application
The cumulative distribution function (cdf) of a sum of correlated or even independent lognormal random variables (RVs), which is of wide interest in wireless communications, remain...
Chintha Tellambura
ALGORITHMICA
2004
150views more  ALGORITHMICA 2004»
14 years 11 months ago
Sum Coloring of Bipartite Graphs with Bounded Degree
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
Michal Malafiejski, Krzysztof Giaro, Robert Jancze...
JMMA
2002
71views more  JMMA 2002»
14 years 11 months ago
Optimal Hierarchies for Quadrilateral Surfaces
Abstract. Multiresolution representation of quadrilateral surface approximation (MRQSA) is a useful representation for progressive graphics transmission in networks. Based on two r...
Kuo-Liang Chung, Wen-Ming Yan, Jung-Gen Wu
WIOPT
2011
IEEE
14 years 3 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...