702 search results - page 39 / 141 » Identifying Graph Automorphisms Using Determining Sets |
131
click to vote
ICMCS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a robust and efficient skeleton-based graph matching method for object recognition and recovery applications. The novel feature is to unify both object recogni...
168
Voted
SMI
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...
165
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
130
Voted
CISS
2008
IEEE
2008
IEEE
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
15 years 11 months ago
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
198
Voted
TMM
2010
14 years 11 months ago
2010
Abstract--Unlimited vocabulary annotation of multimedia documents remains elusive despite progress solving the problem in the case of a small, fixed lexicon. Taking advantage of th...