Sciweavers

14161 search results - page 2717 / 2833
» On generalized middle-level problem
Sort
View
COMPUTE
2010
ACM
15 years 8 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
SACMAT
2010
ACM
15 years 8 months ago
Mining roles with noisy data
There has been increasing interest in automatic techniques for generating roles for role based access control, a process known as role mining. Most role mining approaches assume t...
Ian Molloy, Ninghui Li, Yuan (Alan) Qi, Jorge Lobo...
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 8 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
WWW
2010
ACM
15 years 8 months ago
Access: news and blog analysis for the social sciences
The social sciences strive to understand the political, social, and cultural world around us, but have been impaired by limited access to the quantitative data sources enjoyed by ...
Mikhail Bautin, Charles B. Ward, Akshay Patil, Ste...
3DIM
1999
IEEE
15 years 8 months ago
Large Data Sets and Confusing Scenes in 3-D Surface Matching and Recognition
In this paper, we report on recent extensions to a surface matching algorithm based on local 3-D signatures. This algorithm was previously shown to be effective in view registrati...
Owen T. Carmichael, Daniel F. Huber, Martial Heber...
« Prev « First page 2717 / 2833 Last » Next »