3757 search results - page 715 / 752 » The overlap number of a graph |
176
click to vote
SIGMOD
2008
ACM
16 years 13 hour ago
2008
ACM
In this paper, we present Spade - the System S declarative stream processing engine. System S is a large-scale, distributed data stream processing middleware under development at ...
122
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
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...
EWSN
2010
Springer
15 years 9 months ago
2010
Springer
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...
110
click to vote
ICCAD
2008
IEEE
15 years 8 months ago
2008
IEEE
— 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...
112
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
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 ...