Sciweavers

2556 search results - page 318 / 512
» Clustering processes
Sort
View
WWW
2004
ACM
16 years 7 months ago
Outlink estimation for pagerank computation under missing data
The enormity and rapid growth of the web-graph forces quantities such as its pagerank to be computed under missing information consisting of outlinks of pages that have not yet be...
Sreangsu Acharyya, Joydeep Ghosh
WWW
2004
ACM
16 years 7 months ago
Distributed ranking over peer-to-peer networks
Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intellig...
Dexter Chi Wai Siu, Tak Pang Lau
KDD
2009
ACM
217views Data Mining» more  KDD 2009»
16 years 7 months ago
Efficient anomaly monitoring over moving object trajectory streams
Lately there exist increasing demands for online abnormality monitoring over trajectory streams, which are obtained from moving object tracking devices. This problem is challengin...
Yingyi Bu, Lei Chen 0002, Ada Wai-Chee Fu, Dawei L...
CVPR
2010
IEEE
16 years 3 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
ICC
2009
IEEE
112views Communications» more  ICC 2009»
16 years 1 months ago
Towards Secure Spectrum Decision
—The key idea of dynamic spectrum access (DSA) networks is to allow the secondary, unlicensed users to detect and use unused portions of the spectrum (white spaces) opportunistic...
Goce Jakimoski, K. P. Subbalakshmi