231 search results - page 31 / 47 » The Number of Independent Sets in a Regular Graph |
PODC
2005
ACM
15 years 5 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract--In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method "label-and-decide." W...
208
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
WDAG
2010
Springer
14 years 10 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
169
Voted
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
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...