Sciweavers

40 search results - page 7 / 8
» A Fast Dual Method for HIK SVM Learning
Sort
View
ICML
2009
IEEE
14 years 6 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo
ICIC
2005
Springer
13 years 11 months ago
Sequential Stratified Sampling Belief Propagation for Multiple Targets Tracking
Rather than the difficulties of highly non-linear and non-Gaussian observation process and the state distribution in single target tracking, the presence of a large, varying number...
Jianru Xue, Nanning Zheng, Xiaopin Zhong
GIS
2008
ACM
14 years 6 months ago
Fast and extensible building modeling from airborne LiDAR data
This paper presents an automatic algorithm which reconstructs building models from airborne LiDAR (light detection and ranging) data of urban areas. While our algorithm inherits t...
Qian-Yi Zhou, Ulrich Neumann
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 5 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
SIGIR
2011
ACM
12 years 8 months ago
Social context summarization
We study a novel problem of social context summarization for Web documents. Traditional summarization research has focused on extracting informative sentences from standard docume...
Zi Yang, Keke Cai, Jie Tang, Li Zhang, Zhong Su, J...