Sciweavers

192 search results - page 36 / 39
» Effective formulation reductions for the quadratic assignmen...
Sort
View
CORR
2010
Springer
177views Education» more  CORR 2010»
14 years 9 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
CORR
2010
Springer
201views Education» more  CORR 2010»
14 years 7 months ago
Online Advertisement, Optimization and Stochastic Networks
In this paper, we propose a stochastic model to describe how search service providers charge client companies based on users' queries for the keywords related to these compan...
R. Srikant
AI
2005
Springer
14 years 9 months ago
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
Zhao Xing, Weixiong Zhang
PR
2010
145views more  PR 2010»
14 years 8 months ago
Graph-optimized locality preserving projections
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
Limei Zhang, Lishan Qiao, Songcan Chen
ICML
2004
IEEE
15 years 10 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye