Sciweavers

2270 search results - page 445 / 454
» On the distribution of eigenvalues of graphs
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 14 days ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
AAIM
2006
Springer
129views Algorithms» more  AAIM 2006»
14 years 10 days ago
Secure Overlay Network Design
Due to the increasing security threats on the Internet, new overlay network architectures have been proposed to secure privileged services. In these architectures, the application...
Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni
CIKM
2006
Springer
14 years 10 days ago
Knowing a web page by the company it keeps
Web page classification is important to many tasks in information retrieval and web mining. However, applying traditional textual classifiers on web data often produces unsatisfyi...
Xiaoguang Qi, Brian D. Davison
CIKM
2006
Springer
14 years 10 days ago
Eigen-trend: trend analysis in the blogosphere based on singular value decompositions
The blogosphere--the totality of blog-related Web sites-has become a great source of trend analysis in areas such as product survey, customer relationship, and marketing. Existing...
Yun Chi, Belle L. Tseng, Jun'ichi Tatemura
NLP
2000
14 years 5 days ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman