1969 search results - page 60 / 394 » Incremental Processing and Acceptability |
199
click to vote
JMLR
2012
13 years 7 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
279
click to vote
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
Data warehousing and on-line analytical processing (OLAP) are essential for decision support applications. Common OLAP operations include for example drill down, roll up, pivot an...
165
click to vote
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
166
click to vote
ICML
1995
IEEE
16 years 6 months ago
1995
IEEE
This paper describes an approach to automatically learn planning operators by observing expert solution traces and to further refine the operators through practice in a learning-b...
144
click to vote
AI
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...