Sciweavers

447 search results - page 84 / 90
» Decision trees with minimal costs
Sort
View
FOCS
2003
IEEE
14 years 3 months ago
Approximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
Avrim Blum, Shuchi Chawla, David R. Karger, Terran...
ICC
2007
IEEE
143views Communications» more  ICC 2007»
14 years 4 months ago
An Improved Joint M-Algorithm for Single Antenna Interference Cancellation in TDMA Mobile Radio
— We target M-ary data sequence estimation over time-variant frequency selective fading channels subject to cochannel interference (CCI). A novel joint reduced state sequence est...
Thorben Detert, Romain Drauge
KDD
2008
ACM
207views Data Mining» more  KDD 2008»
14 years 10 months ago
Active learning with direct query construction
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
Charles X. Ling, Jun Du
FSKD
2007
Springer
98views Fuzzy Logic» more  FSKD 2007»
14 years 4 months ago
Learning Selective Averaged One-Dependence Estimators for Probability Estimation
Naïve Bayes is a well-known effective and efficient classification algorithm, but its probability estimation performance is poor. Averaged One-Dependence Estimators, simply AODE,...
Qing Wang, Chuan-hua Zhou, Jiankui Guo
VLDB
2005
ACM
162views Database» more  VLDB 2005»
14 years 3 months ago
XQuery Implementation in a Relational Database System
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
Shankar Pal, Istvan Cseri, Oliver Seeliger, Michae...