Sciweavers

498 search results - page 68 / 100
» Estimating Robust Query Models with Convex Optimization
Sort
View
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 4 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
NIPS
2008
13 years 10 months ago
Partially Observed Maximum Entropy Discrimination Markov Networks
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
Jun Zhu, Eric P. Xing, Bo Zhang
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 9 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
ISCI
2007
115views more  ISCI 2007»
13 years 9 months ago
Compressed histograms with arbitrary bucket layouts for selectivity estimation
Selectivity estimation is an important step of query optimization in a database management system, and multidimensional histogram techniques have proved promising for selectivity ...
Dennis Fuchs, Zhen He, Byung Suk Lee
ICDE
2007
IEEE
175views Database» more  ICDE 2007»
14 years 10 months ago
Dynamic Batch Nearest Neighbor Search in Video Retrieval
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
Jie Shao, Zi Huang, Heng Tao Shen, Xiaofang Zhou, ...