Sciweavers

496 search results - page 11 / 100
» Machine models and lower bounds for query processing
Sort
View
COLT
2004
Springer
13 years 11 months ago
Minimizing Regret with Label Efficient Prediction
We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after gues...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...
COLT
2005
Springer
14 years 1 months ago
Learning a Hidden Hypergraph
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
Dana Angluin, Jiang Chen
DEXA
2003
Springer
135views Database» more  DEXA 2003»
14 years 26 days ago
On the Optimality of Holistic Algorithms for Twig Queries
Streaming XML documents has many emerging applications. However, in this paper, we show that the restrictions imposed by data streaming are too restrictive for processing twig quer...
Byron Choi, Malika Mahoui, Derick Wood
ANOR
2005
56views more  ANOR 2005»
13 years 7 months ago
Two-Machine Flowshop Batching and Scheduling
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
Bertrand M. T. Lin, T. C. Edwin Cheng
ICDE
2007
IEEE
205views Database» more  ICDE 2007»
14 years 9 months ago
Multi-source Skyline Query Processing in Road Networks
Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a single-source skyline query is to find hotel...
Ke Deng, Xiaofang Zhou, Heng Tao Shen