Sciweavers

1435 search results - page 219 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
102
Voted
KDD
2003
ACM
129views Data Mining» more  KDD 2003»
16 years 3 months ago
Empirical comparisons of various voting methods in bagging
Finding effective methods for developing an ensemble of models has been an active research area of large-scale data mining in recent years. Models learned from data are often subj...
Kelvin T. Leung, Douglas Stott Parker Jr.
120
Voted
WSNA
2003
ACM
15 years 7 months ago
Cleaning and querying noisy sensors
Sensor networks have become an important source of data with numerous applications in monitoring various real-life phenomena as well as industrial applications and traffic contro...
Eiman Elnahrawy, Badri Nath
168
Voted
ESOP
2000
Springer
15 years 6 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
INFOCOM
2010
IEEE
15 years 1 months ago
Bayesian Inference for Localization in Cellular Networks
—In this paper, we present a general technique based on Bayesian inference to locate mobiles in cellular networks. We study the problem of localizing users in a cellular network ...
Hui Zang, François Baccelli, Jean Bolot
102
Voted
ISMB
1997
15 years 4 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey