Sciweavers

2382 search results - page 82 / 477
» Generating Seeded Trees from Data Sets
Sort
View
AAAI
2007
15 years 6 months ago
Recognizing Textual Entailment Using a Subsequence Kernel Method
We present a novel approach to recognizing Textual nt. Structural features are constructed from abstract tree descriptions, which are automatically extracted from syntactic depend...
Rui Wang 0005, Günter Neumann
ICC
2009
IEEE
136views Communications» more  ICC 2009»
15 years 11 months ago
Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks
—The connected dominating set (CDS) has been commonly used for routing and broadcast in mobile ad hoc networks (MANETs). Considering the applications of MANETs, it is generally p...
Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku
DASFAA
2004
IEEE
135views Database» more  DASFAA 2004»
15 years 8 months ago
Semi-supervised Text Classification Using Partitioned EM
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
Gao Cong, Wee Sun Lee, Haoran Wu, Bing Liu
ECML
2005
Springer
15 years 10 months ago
Learning from Positive and Unlabeled Examples with Different Data Distributions
Abstract. We study the problem of learning from positive and unlabeled examples. Although several techniques exist for dealing with this problem, they all assume that positive exam...
Xiaoli Li, Bing Liu
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 10 months ago
A multi-objective approach to search-based test data generation
There has been a considerable body of work on search–based test data generation for branch coverage. However, hitherto, there has been no work on multi–objective branch covera...
Kiran Lakhotia, Mark Harman, Phil McMinn