Sciweavers

498 search results - page 26 / 100
» Estimating Robust Query Models with Convex Optimization
Sort
View
ICDE
2008
IEEE
144views Database» more  ICDE 2008»
14 years 9 months ago
QShuffler: Getting the Query Mix Right
The typical workload in a database system consists of a mixture of multiple queries of different types, running concurrently and interacting with each other. Hence, optimizing perf...
Mumtaz Ahmad, Ashraf Aboulnaga, Shivnath Babu, Kam...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 8 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
ICCV
2009
IEEE
15 years 22 days ago
Tensor completion for estimating missing values in visual data
In this paper we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process, or because the ...
Ji Liu, Przemyslaw Musialski, Peter Wonka, Jieping...
TREC
2004
13 years 9 months ago
University of Glasgow at TREC 2004: Experiments in Web, Robust, and Terabyte Tracks with Terrier
With our participation in TREC2004, we test Terrier, a modular and scalable Information Retrieval framework, in three tracks. For the mixed query task of the Web track, we employ ...
Vassilis Plachouras, Ben He, Iadh Ounis
ICDM
2006
IEEE
183views Data Mining» more  ICDM 2006»
14 years 1 months ago
Accelerating Newton Optimization for Log-Linear Models through Feature Redundancy
— Log-linear models are widely used for labeling feature vectors and graphical models, typically to estimate robust conditional distributions in presence of a large number of pot...
Arpit Mathur, Soumen Chakrabarti