Sciweavers

16093 search results - page 2783 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Surface Coverage in Wireless Sensor Networks
—Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. In many real wo...
Ming-Chen Zhao, Jiayin Lei, Min-You Wu, Yunhuai Li...
INFOCOM
2009
IEEE
16 years 1 months ago
Physical Interference Modeling for Transmission Scheduling on Commodity WiFi Hardware
—The demand for capacity in WiFi networks is driving a new look at transmission scheduling based link layers, particularly in the context of mesh networks. One basic issue here i...
Ritesh Maheshwari, Jing Cao, Samir R. Das
WADS
2009
Springer
232views Algorithms» more  WADS 2009»
16 years 1 months ago
On Making Directed Graphs Transitive
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
ATAL
2009
Springer
16 years 1 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson
CIKM
2009
Springer
16 years 1 months ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
« Prev « First page 2783 / 3219 Last » Next »