Sciweavers

4171 search results - page 303 / 835
» Choice numbers of graphs
Sort
View
IWCMC
2006
ACM
16 years 23 days ago
Voice capacity under quality constraints for IEEE 802.11a based WLANs
The communication of voice over wireless local area networks (WLANs) is influenced by the choice of speech codec, packetization interval and PHY layer bit rates. These choices a...
Niranjan Shetty, Sayantan Choudhury, Jerry D. Gibs...
INFOCOM
2005
IEEE
16 years 12 days ago
Bounding the power rate function of wireless ad hoc networks
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
Yunnan Wu, Qian Zhang, Wenwu Zhu, Sun-Yuan Kung
TCS
2010
15 years 5 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
WWW
2011
ACM
15 years 1 months ago
Estimating sizes of social networks via biased sampling
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
Liran Katzir, Edo Liberty, Oren Somekh
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
16 years 1 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...