Sciweavers

139 search results - page 21 / 28
» The Domatic Number of Regular Graphs
Sort
View
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
14 years 1 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
SPAA
2009
ACM
14 years 8 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
LCTRTS
2005
Springer
14 years 1 months ago
Generation of permutations for SIMD processors
Short vector (SIMD) instructions are useful in signal processing, multimedia, and scientific applications. They offer higher performance, lower energy consumption, and better res...
Alexei Kudriavtsev, Peter M. Kogge
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
14 years 9 months ago
Training Linear Discriminant Analysis in Linear Time
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...
Deng Cai, Xiaofei He, Jiawei Han
CVPR
2009
IEEE
15 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