Sciweavers

1091 search results - page 131 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
ECCV
2006
Springer
14 years 10 months ago
Learning Nonlinear Manifolds from Time Series
Abstract. There has been growing interest in developing nonlinear dimensionality reduction algorithms for vision applications. Although progress has been made in recent years, conv...
Ruei-Sung Lin, Che-Bin Liu, Ming-Hsuan Yang, Naren...
PPSC
1997
13 years 9 months ago
The Future Fast Fourier Transform?
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
Alan Edelman, Peter McCorquodale, Sivan Toledo
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 7 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...
IJCAI
2007
13 years 9 months ago
Maximum Margin Coresets for Active and Noise Tolerant Learning
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
Sariel Har-Peled, Dan Roth, Dav Zimak
IPMI
2011
Springer
12 years 11 months ago
Nonnegative Factorization of Diffusion Tensor Images and Its Applications
This paper proposes a novel method for computing linear basis images from tensor-valued image data. As a generalization of the nonnegative matrix factorization, the proposed method...
Yuchen Xie, Jeffrey Ho, Baba C. Vemuri