1871 search results - page 227 / 375 » The Ephemeral Pairing Problem |
156
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
186
click to vote
AAAI
2006
15 years 8 months ago
2006
Record linkage is the process of matching records across data sets that refer to the same entity. One issue within record linkage is determining which record pairs to consider, si...
199
click to vote
AAAI
2006
15 years 8 months ago
2006
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
157
click to vote
NIPS
2004
15 years 8 months ago
2004
We address the problem of identifying specific instances of a class (cars) from a set of images all belonging to that class. Although we cannot build a model for any particular in...
190
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...