172 search results - page 13 / 35 » The Analysis of a List-Coloring Algorithm on a Random Graph |
ACST
2006
13 years 9 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
SOCIALCOM
2010
13 years 5 months ago
2010
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Finding fiducial facial points in any frame of a video showing rich naturalistic facial behaviour is an unsolved problem. Yet this is a crucial step for geometric-featurebased fa...
MST
2010
13 years 2 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...