Sciweavers

3268 search results - page 376 / 654
» The hub number of a graph
Sort
View
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
15 years 5 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
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,...
Johannes Schneider, Roger Wattenhofer
SOCIALCOM
2010
15 years 4 months ago
Estimating the Size of Online Social Networks
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...
Shaozhi Ye, Shyhtsun Felix Wu
ICIP
2009
IEEE
15 years 4 months ago
Markovian clustering for the non-local means image denoising
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 ...
Rachid Hedjam, Reza Farrahi Moghaddam, Mohamed Che...
DCG
2011
15 years 1 months ago
Random Geometric Complexes
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
Matthew Kahle
BMCBI
2011
15 years 1 months ago
Ultra-fast sequence clustering from similarity networks with SiLiX
Background: The number of gene sequences that are available for comparative genomics approaches is increasing extremely quickly. A current challenge is to be able to handle this h...
Vincent Miele, Simon Penel, Laurent Duret