Sciweavers

8486 search results - page 19 / 1698
» Ordered Enumeration Method
Sort
View
COMAD
2009
13 years 8 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
CCS
2009
ACM
14 years 8 months ago
Towards complete node enumeration in a peer-to-peer botnet
Modern advanced botnets may employ a decentralized peer-to-peer overlay network to bootstrap and maintain their command and control channels, making them more resilient to traditi...
Brent ByungHoon Kang, Eric Chan-Tin, Christopher P...
COMBINATORICS
1998
76views more  COMBINATORICS 1998»
13 years 7 months ago
An Exploration of the Permanent-Determinant Method
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
Greg Kuperberg
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 7 months ago
The Induced Subgraph Order on Unlabelled Graphs
A differential poset is a partially ordered set with raising and lowering operators U and D which satisfy the commutation relation DU-UD = rI for some constant r. This notion may ...
Craig A. Sloss
IPPS
2008
IEEE
14 years 1 months ago
Ordered index seed algorithm for intensive DNA sequence comparison
This paper presents a seed-based algorithm for intensive DNA sequence comparison. The novelty comes from the way seeds are used to efficiently generate small ungapped alignments ...
Dominique Lavenier