Sciweavers

4103 search results - page 249 / 821
» Some results on the Collatz problem
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
Fixed-rank representation for unsupervised visual learning
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
Risheng Liu, Zhouchen Lin, Fernando De la Torre, Z...
CPAIOR
2008
Springer
15 years 8 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
PR
2006
164views more  PR 2006»
15 years 6 months ago
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
Hong Chang, Dit-Yan Yeung
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
16 years 1 hour ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
SBIA
2004
Springer
16 years 3 days ago
Learning with Class Skews and Small Disjuncts
One of the main objectives of a Machine Learning – ML – system is to induce a classifier that minimizes classification errors. Two relevant topics in ML are the understanding...
Ronaldo C. Prati, Gustavo E. A. P. A. Batista, Mar...