Sciweavers

498 search results - page 31 / 100
» Experimental comparison of the two Fredman-Khachiyan-algorit...
Sort
View
CVPR
2003
IEEE
16 years 3 months ago
Clustering Appearances of Objects Under Varying Illumination Conditions
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
Jeffrey Ho, Ming-Hsuan Yang, Jongwoo Lim, Kuang-Ch...
ICML
2009
IEEE
16 years 2 months ago
On sampling-based approximate spectral decomposition
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar
SEMWEB
2009
Springer
15 years 7 months ago
Computing Minimal Mappings
Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such ...
Fausto Giunchiglia, Vincenzo Maltese, Aliaksandr A...
ROBIO
2006
IEEE
110views Robotics» more  ROBIO 2006»
15 years 7 months ago
Sensor Based Localization for Mobile Robots by Exploration and Selection of Best Direction
Abstract— We present a strategy for resolving multiple hypotheses of a robot’s state during global localization. The strategy operates in two stages. In the first stage a uniq...
Rakesh Goyal, K. Madhava Krishna, Shivudu Bhuvanag...
KES
2004
Springer
15 years 6 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran