Sciweavers

365 search results - page 27 / 73
» Solving the Multiplication Constraint in Several Approximati...
Sort
View
COMGEO
2006
ACM
13 years 7 months ago
Octrees with near optimal cost for ray-shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
Hervé Brönnimann, Marc Glisse
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 10 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
TIT
1998
70views more  TIT 1998»
13 years 7 months ago
The Poisson Multiple-Access Channel
—The Poisson multiple-access channel (MAC) models many-to-one optical communication through an optical fiber or in free space. For this model we compute the capacity region for ...
Amos Lapidoth, Shlomo Shamai
AAAI
2008
13 years 10 months ago
Perpetual Learning for Non-Cooperative Multiple Agents
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
Luke Dickens
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
14 years 2 months ago
Parameter Tuning for Differential Mining of String Patterns
Constraint-based mining has been proven to be extremely useful for supporting actionable pattern discovery. However, useful conjunctions of constraints that support domain driven ...
Jérémy Besson, Christophe Rigotti, I...