Sciweavers

3757 search results - page 458 / 752
» The overlap number of a graph
Sort
View
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
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
FUZZIEEE
2007
IEEE
16 years 1 months ago
Social Measures and Flexible Navigation on Online Contact Networks
— This paper discusses ways of navigating online contact networks - networks of social connections defined under a relational context - on a way that can provide much more meani...
Nikolaos Korfiatis, Miguel-Ángel Sicilia
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
16 years 4 days ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong
IWCMC
2010
ACM
15 years 11 months ago
Group detection in mobility traces
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
Yung-Chih Chen, Elisha J. Rosensweig, Jim Kurose, ...