Sciweavers

1403 search results - page 266 / 281
» Set cover algorithms for very large datasets
Sort
View
RSS
2007
176views Robotics» more  RSS 2007»
13 years 9 months ago
Active Policy Learning for Robot Planning and Exploration under Uncertainty
Abstract— This paper proposes a simulation-based active policy learning algorithm for finite-horizon, partially-observed sequential decision processes. The algorithm is tested i...
Ruben Martinez-Cantin, Nando de Freitas, Arnaud Do...
BMCBI
2008
211views more  BMCBI 2008»
13 years 8 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
PRL
2010
188views more  PRL 2010»
13 years 6 months ago
Sparsity preserving discriminant analysis for single training image face recognition
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
Lishan Qiao, Songcan Chen, Xiaoyang Tan
CVPR
2009
IEEE
15 years 3 months ago
Locally Constrained Diffusion Process on Locally Densified Distance Spaces with Applications to Shape Retrieval
The matching and retrieval of 2D shapes is an important challenge in computer vision. A large number of shape similarity approaches have been developed, with the main focus bein...
Xingwei Yang (Temple University), Suzan Koknar-Tez...
WWW
2007
ACM
14 years 9 months ago
Query-driven indexing for peer-to-peer text retrieval
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
Gleb Skobeltsyn, Toan Luu, Karl Aberer, Martin Raj...