3211 search results - page 372 / 643 » On the Grundy Number of a Graph |
183
click to vote
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
185
click to vote
SOCIALCOM
2010
15 years 4 months ago
2010
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
187
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
The non-local means filter is one of powerful denoising methods which allows participation of far, but proper pixels in the denoising process. Although the weights of non-similar ...
207
click to vote
TMC
2011
15 years 1 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
188
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...