2004 search results - page 19 / 401 » Sampling from large graphs |
118
click to vote
KDD
2008
ACM
16 years 3 days ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
MLG
2007
Springer
15 years 5 months ago
2007
Springer
: Network topology not only tells about tightly-connected “communities,” but also gives cues on more subtle properties of the vertices. We introduce a simple probabilistic late...
BIRTHDAY
2005
Springer
15 years 1 months ago
2005
Springer
Software engineers usually represent problems and solutions aph-based notations at different levels of abstractions. These notations are often semi-formal, but the use of graph tr...
BMCBI
2006
14 years 11 months ago
2006
Background: The Thymidine kinase (Tk) mutants generated from the widely used L5178Y mouse lymphoma assay fall into two categories, small colony and large colony. Cells from the la...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we present a dynamic model for simulating face aging process. We adopt a high resolution grammatical face model[1] and augment it with age and hair features. This mo...