Sciweavers

676 search results - page 102 / 136
» A Search-Free Intersection Algorithm
Sort
View
86
Voted
ICML
2008
IEEE
16 years 1 months ago
Bolasso: model consistent Lasso estimation through the bootstrap
We consider the least-square linear regression problem with regularization by the 1-norm, a problem usually referred to as the Lasso. In this paper, we present a detailed asymptot...
Francis R. Bach
ICML
2006
IEEE
16 years 1 months ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal
ISBI
2006
IEEE
16 years 1 months ago
3D tumor shape reconstruction from 2D bioluminescence images
This paper introduces a novel and efficient algorithm for reconstructing the 3D shapes of tumors from a set of 2D bioluminescence images which are taken by the same camera but aft...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas,...
115
Voted
WWW
2008
ACM
16 years 1 months ago
Unsupervised query segmentation using generative language models and wikipedia
In this paper, we propose a novel unsupervised approach to query segmentation, an important task in Web search. We use a generative query model to recover a query's underlyin...
Bin Tan, Fuchun Peng
108
Voted
STOC
2009
ACM
224views Algorithms» more  STOC 2009»
16 years 1 months ago
3-query locally decodable codes of subexponential length
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
Klim Efremenko