Sciweavers

381 search results - page 43 / 77
» On the advantage over a random assignment
Sort
View
ML
2010
ACM
119views Machine Learning» more  ML 2010»
13 years 6 months ago
A cooperative coevolutionary algorithm for instance selection for instance-based learning
This paper presents a cooperative evolutionary approach for the problem of instance selection for instance based learning. The presented model takes advantage of one of the most r...
Nicolás García-Pedrajas, Juan Antoni...
CVPR
2009
IEEE
15 years 3 months ago
Efficient Scale Space Auto-Context for Image Segmentation and Labeling
The Conditional Random Fields (CRF) model, using patch-based classification bound with context information, has recently been widely adopted for image segmentation/ labeling. In...
Jiayan Jiang (UCLA), Zhuowen Tu (UCLA)
PAKDD
2005
ACM
94views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Progressive Sampling for Association Rules Based on Sampling Error Estimation
We explore in this paper a progressive sampling algorithm, called Sampling Error Estimation (SEE), which aims to identify an appropriate sample size for mining association rules. S...
Kun-Ta Chuang, Ming-Syan Chen, Wen-Chieh Yang
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 7 months ago
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signi...
Salim Y. El Rouayheb, Mohammad Asad R. Chaudhry, A...
SIGIR
2009
ACM
14 years 2 months ago
Evaluating web search using task completion time
We consider experiments to measure the quality of a web search algorithm based on how much total time users take to complete assigned search tasks using that algorithm. We first ...
Ya Xu, David Mease