Sciweavers

155 search results - page 5 / 31
» Constructing search spaces for materialized view selection
Sort
View
KDD
1995
ACM
133views Data Mining» more  KDD 1995»
13 years 11 months ago
Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology
In the wrapperapproachto feature subset selection, a searchfor an optimalset of features is madeusingthe induction algorithm as a black box. Theestimated future performanceof the ...
Ron Kohavi, Dan Sommerfield
DL
1999
Springer
139views Digital Library» more  DL 1999»
13 years 11 months ago
Constructing Web Views from Automated Navigation Sessions
Existing web search engines provide users with the ability to query an off-line database of indices in order to decide on an entry point for further manual navigation. Results are...
Nadav Zin, Mark Levene
FGR
2006
IEEE
147views Biometrics» more  FGR 2006»
14 years 1 months ago
Learning Sparse Features in Granular Space for Multi-View Face Detection
In this paper, a novel sparse feature set is introduced into the Adaboost learning framework for multi-view face detection (MVFD), and a learning algorithm based on heuristic sear...
Chang Huang, Haizhou Ai, Yuan Li, Shihong Lao
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
12 years 10 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
14 years 7 months ago
Asynchronous view maintenance for VLSD databases
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
Parag Agrawal, Adam Silberstein, Brian F. Cooper, ...