Sciweavers

3250 search results - page 611 / 650
» An Algorithm to Solve a Linear Program
Sort
View
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
11 years 11 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 11 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
CVPR
2009
IEEE
1372views Computer Vision» more  CVPR 2009»
15 years 3 months ago
Blind motion deblurring from a single image using sparse approximation
Restoring a clear image from a single motion-blurred image due to camera shake has long been a challenging problem in digital imaging. Existing blind deblurring techniques eithe...
Jian-Feng Cai (National University of Singapore), ...
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
14 years 9 months ago
Cross domain distribution adaptation via kernel mapping
When labeled examples are limited and difficult to obtain, transfer learning employs knowledge from a source domain to improve learning accuracy in the target domain. However, the...
ErHeng Zhong, Wei Fan, Jing Peng, Kun Zhang, Jiang...
CIVR
2003
Springer
200views Image Analysis» more  CIVR 2003»
14 years 1 months ago
Multimedia Search with Pseudo-relevance Feedback
We present an algorithm for video retrieval that fuses the decisions of multiple retrieval agents in both text and image modalities. While the normalization and combination of evi...
Rong Yan, Alexander G. Hauptmann, Rong Jin