Sciweavers

740 search results - page 116 / 148
» An approximation ratio for biclustering
Sort
View
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 5 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
15 years 5 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
ICC
2007
IEEE
127views Communications» more  ICC 2007»
15 years 3 months ago
Spectral Efficiency of Channel-Aware Schedulers in Non-Identical Composite Links with Interference
Accurate system planning and performance evaluation requires knowledge of the joint impact of scheduling, interference, and fading. However, current analyses either require costly...
Jingxian Wu, Neelesh B. Mehta, Andreas F. Molisch,...
COMCOM
2006
168views more  COMCOM 2006»
14 years 12 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen
INFOCOM
2010
IEEE
14 years 10 months ago
Deploying Mesh Nodes under Non-Uniform Propagation
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
Joshua Robinson, Mohit Singh, Ram Swaminathan, Edw...