Sciweavers

3517 search results - page 304 / 704
» Online Learning with Queries
Sort
View
NIPS
2007
15 years 8 months ago
Active Preference Learning with Discrete Choice Data
We propose an active learning algorithm that learns a continuous valuation model from discrete preferences. The algorithm automatically decides what items are best presented to an...
Eric Brochu, Nando de Freitas, Abhijeet Ghosh
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 8 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
DCC
2008
IEEE
16 years 6 months ago
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
Johannes Fischer, Volker Heun, Horst Martin St&uum...
ICPADS
2005
IEEE
16 years 9 days ago
A Model for Distributing and Querying a Data Warehouse on a Computing Grid
Data warehouses store large volumes of data according to a multidimensional model with dimensions representing different axes of analysis. OLAP systems (OnLine Analytical Processi...
Pascal Wehrle, Maryvonne Miquel, Anne Tchounikine
DOLAP
2008
ACM
15 years 8 months ago
Bridging the semantic gap in OLAP models: platform-independent queries
The development of data warehouses is based on a threestage process that starts specifying both the static and dynamic properties of on-line analytical processing (OLAP) applicati...
Jesús Pardillo, Jose-Norberto Mazón,...