Sciweavers

879 search results - page 66 / 176
» Greedy Attribute Selection
Sort
View
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 9 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
144
Voted
ML
2000
ACM
157views Machine Learning» more  ML 2000»
15 years 3 months ago
A Multistrategy Approach to Classifier Learning from Time Series
We present an approach to inductive concept learning using multiple models for time series. Our objective is to improve the efficiency and accuracy of concept learning by decomposi...
William H. Hsu, Sylvian R. Ray, David C. Wilkins
ICML
2006
IEEE
16 years 5 months ago
Active learning via transductive experimental design
This paper considers the problem of selecting the most informative experiments x to get measurements y for learning a regression model y = f(x). We propose a novel and simple conc...
Kai Yu, Jinbo Bi, Volker Tresp
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
15 years 10 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
ICC
2007
IEEE
179views Communications» more  ICC 2007»
15 years 10 months ago
An Improved Vehicular Ad Hoc Routing Protocol for City Environments
—The fundamental component for the success of VANET (Vehicular Ad hoc NETworks) applications is routing since it must efficiently handle rapid topology changes and a fragmented n...
Moez Jerbi, Sidi-Mohammed Senouci, Rabah Meraihi, ...