Sciweavers

452 search results - page 66 / 91
» On Weighting Clustering
Sort
View
IPL
1998
119views more  IPL 1998»
14 years 11 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
COMPSEC
2010
122views more  COMPSEC 2010»
14 years 10 months ago
Taming role mining complexity in RBAC
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
Alessandro Colantonio, Roberto Di Pietro, Alberto ...
ECCV
2010
Springer
15 years 5 months ago
Detecting People Using Mutually Consistent Poselet Activations
Bourdev and Malik (ICCV 09) introduced a new notion of parts, poselets, constructed to be tightly clustered both in the configuration space of keypoints, as well as in the appeara...
CVPR
2010
IEEE
15 years 9 months ago
Online Visual Vocabulary Pruning Using Pairwise Constraints
Given a pair of images represented using bag-of-visual words and a label corresponding to whether the images are “related”(must-link constraint) or “unrelated” (must not li...
Pavan Mallapragada, Rong Jin and Anil Jain
ADC
2005
Springer
183views Database» more  ADC 2005»
15 years 5 months ago
Discovering User Access Pattern Based on Probabilistic Latent Factor Model
There has been an increased demand for characterizing user access patterns using web mining techniques since the informative knowledge extracted from web server log files can not ...
Guandong Xu, Yanchun Zhang, Jiangang Ma, Xiaofang ...