Sciweavers

11949 search results - page 250 / 2390
» Some results on (a:b)-choosability
Sort
View
115
Voted
STOC
2006
ACM
168views Algorithms» more  STOC 2006»
16 years 1 months ago
A combinatorial characterization of the testable graph properties: it's all about regularity
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapir...
119
Voted
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 1 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
ECIR
2009
Springer
15 years 10 months ago
Choosing the Best MT Programs for CLIR Purposes - Can MT Metrics Be Helpful?
Abstract. This paper describes usage of MT metrics in choosing the best candidates for MT-based query translation resources. Our main metrics is METEOR, but we also use NIST and BL...
Kimmo Kettunen
ISDA
2009
IEEE
15 years 8 months ago
Improving Academic Performance Prediction by Dealing with Class Imbalance
Abstract—This paper introduces and compares some techniques used to predict the student performance at the university. Recently, researchers have focused on applying machine lear...
Nguyen Thai-Nghe, Andre Busche, Lars Schmidt-Thiem...
TRIDENTCOM
2008
IEEE
15 years 8 months ago
A quantitative evaluation of the MeshTest wireless testbed
The MeshTest testbed is designed to subject wireless devices and protocols to realistic and repeatable mobile scenarios, including multi-hop and disconnected topologies. The testb...
Brenton Walker, Charles Clancy