Sciweavers

4298 search results - page 80 / 860
» Measurable chromatic numbers
Sort
View
SAC
2008
ACM
15 years 5 months ago
An efficient feature ranking measure for text categorization
A major obstacle that decreases the performance of text classifiers is the extremely high dimensionality of text data. To reduce the dimension, a number of approaches based on rou...
Songbo Tan, Yuefen Wang, Xueqi Cheng
PODC
2006
ACM
16 years 9 days ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
ICDM
2005
IEEE
117views Data Mining» more  ICDM 2005»
15 years 12 months ago
On Learning Asymmetric Dissimilarity Measures
Many practical applications require that distance measures to be asymmetric and context-sensitive. We introduce Context-sensitive Learnable Asymmetric Dissimilarity (CLAD) measure...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...
IMC
2004
ACM
15 years 11 months ago
Strategies for sound internet measurement
Conducting an Internet measurement study in a sound fashion can be much more difficult than it might first appear. We present a number of strategies drawn from experiences for a...
Vern Paxson
ICSM
2002
IEEE
15 years 11 months ago
ICBMC: An Improved Cohesion Measure for Classes
Class cohesion could be used to evaluate the design quality of classes, to develop test measures for objectoriented software and to restructure poorly designed classes. Among a nu...
Yuming Zhou, Baowen Xu, Jianjun Zhao, Hongji Yang