Sciweavers

847 search results - page 141 / 170
» Approximation algorithms for projective clustering
Sort
View
ISVC
2009
Springer
15 years 5 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
135
Voted
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 6 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
WINE
2009
Springer
178views Economy» more  WINE 2009»
15 years 5 months ago
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
Yuval Emek, Michal Feldman
RTSS
1999
IEEE
15 years 3 months ago
A Scalable Solution to the Multi-Resource QoS Problem
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
Chen Lee, John P. Lehoczky, Daniel P. Siewiorek, R...
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
15 years 11 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni