Sciweavers

3204 search results - page 267 / 641
» The Alcuin Number of a Graph
Sort
View
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
DM
2010
124views more  DM 2010»
15 years 6 months ago
Asymptotic enumeration of 2-covers and line graphs
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...
Peter J. Cameron, Thomas Prellberg, Dudley Stark
SODA
2003
ACM
138views Algorithms» more  SODA 2003»
15 years 8 months ago
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
Hung Q. Ngo, Van H. Vu