2531 search results - page 251 / 507 » Group testing in graphs |
134
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
135
click to vote
CIBCB
2007
IEEE
16 years 26 days ago
2007
IEEE
—Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks...
157
click to vote
SMC
2007
IEEE
16 years 24 days ago
2007
IEEE
— This paper presents two approaches to visually analyze the topic shift of a pool of documents over a given period of time. The first of the proposed methods is based on a mult...
159
click to vote
CIVR
2007
Springer
16 years 21 days ago
2007
Springer
The ability to match faces in video is a crucial component for many multimedia applications such as searching and recognizing people in semantic video browsing, surveillance and h...
172
click to vote
ACMSE
2006
ACM
16 years 15 days ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...