Sciweavers

256 search results - page 31 / 52
» Sparse random graphs with clustering
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec
ACMSE
2005
ACM
14 years 1 months ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan
ICMCS
2007
IEEE
203views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
Jinjun Wang, Wei Xu, Shenghuo Zhu, Yihong Gong
CIKM
2010
Springer
13 years 6 months ago
Hypergraph-based multilevel matrix approximation for text information retrieval
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
Haw-ren Fang, Yousef Saad
CIKM
2010
Springer
13 years 6 months ago
Building recommendation systems using peer-to-peer shared content
Peer-to-Peer (p2p) networks are used for sharing content by millions of users. Often, meta-data used for searching is missing or wrong, making it difficult for users to find cont...
Yuval Shavitt, Ela Weinsberg, Udi Weinsberg