Sciweavers

3204 search results - page 549 / 641
» The Alcuin Number of a Graph
Sort
View
MOBIHOC
2002
ACM
16 years 6 days ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
104
Voted
EWSN
2010
Springer
15 years 9 months ago
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
Marco Zuniga, Chen Avin, Manfred Hauswirth
118
Voted
ICCAD
2008
IEEE
97views Hardware» more  ICCAD 2008»
15 years 9 months ago
Integrated code and data placement in two-dimensional mesh based chip multiprocessors
— As transistor sizes continue to shrink and the number of transistors per chip keeps increasing, chip multiprocessors (CMPs) are becoming a promising alternative to remain on th...
Taylan Yemliha, Shekhar Srikantaiah, Mahmut T. Kan...
118
Voted
WWW
2010
ACM
15 years 7 months ago
Exploiting social context for review quality prediction
Online reviews in which users publish detailed commentary about their experiences and opinions with products, services, or events are extremely valuable to users who rely on them ...
Yue Lu, Panayiotis Tsaparas, Alexandros Ntoulas, L...
DASFAA
2009
IEEE
252views Database» more  DASFAA 2009»
15 years 7 months ago
Optimal Privacy-Aware Path in Hippocratic Databases
Abstract. Privacy becomes a major concern for both customers and enterprises in today’s corporate marketing strategies, many research efforts have been put into developing new p...
Min Li, Xiaoxun Sun, Hua Wang, Yanchun Zhang