Sciweavers

7150 search results - page 422 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
FOCS
2007
IEEE
16 years 1 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
WINE
2009
Springer
202views Economy» more  WINE 2009»
16 years 1 months ago
A New Ranking Scheme of the GSP Mechanism with Markovian Users
Sponsored search auction is used by most search engines to select ads to display on the web page of a search result, according to advertisers’ bidding prices. The income of this ...
Xiaotie Deng, Jiajin Yu
ECCV
2002
Springer
16 years 8 months ago
Learning Shape from Defocus
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
Paolo Favaro, Stefano Soatto
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
16 years 8 months ago
On Multidimensional k-Anonymity with Local Recoding Generalization
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...
Yang Du, Tian Xia, Yufei Tao, Donghui Zhang, Feng ...
ICPR
2004
IEEE
16 years 8 months ago
Efficient Model Selection for Kernel Logistic Regression
Kernel logistic regression models, like their linear counterparts, can be trained using the efficient iteratively reweighted least-squares (IRWLS) algorithm. This approach suggest...
Gavin C. Cawley, Nicola L. C. Talbot