1261 search results - page 179 / 253 » Approximation algorithms for aligning points |
126
click to vote
PODC
2009
ACM
16 years 3 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
144
click to vote
SMA
2008
ACM
15 years 2 months ago
2008
ACM
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
124
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...
NIPS
2007
15 years 4 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
129
click to vote
IPPS
2010
IEEE
15 years 25 days ago
2010
IEEE
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...