Sciweavers

1213 search results - page 67 / 243
» Approximation in quantale-enriched categories
Sort
View
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
15 years 10 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
SI3D
2009
ACM
15 years 4 months ago
Hair self shadowing and transparency depth ordering using occupancy maps
This paper presents a method for quickly constructing a highquality approximate visibility function for high frequency semitransparent geometry such as hair. We can then reconstru...
Erik Sintorn, Ulf Assarsson
KDD
2009
ACM
298views Data Mining» more  KDD 2009»
15 years 4 months ago
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
Rong Pan, Martin Scholz
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
15 years 4 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
ATAL
2009
Springer
15 years 4 months ago
Decentralised dynamic task allocation: a practical game: theoretic approach
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...