Sciweavers

4171 search results - page 469 / 835
» Choice numbers of graphs
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
A Graph-based Approach to Skin Mole Matching Incorporating Template-Normalized Coordinates
Density of moles is a strong predictor of malignant melanoma. Some dermatologists advocate periodic fullbody scan for high-risk patients. In current practice, physicians compare...
Ghassan Hamarneh, Hengameh Mirzaalian, Tim K. Lee
WWW
2001
ACM
16 years 7 months ago
Batch rekeying for secure group communications
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
Xiaozhou (Steve) Li, Yang Richard Yang, Mohamed G....
CADE
2003
Springer
16 years 7 months ago
Source-Tracking Unification
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Venkatesh Choppella, Christopher T. Haynes
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 7 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
ICDCS
2009
IEEE
16 years 4 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir