1871 search results - page 101 / 375 » The Ephemeral Pairing Problem |
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Reconstruction of the point source of blood splatter in a crime scene is an important and difficult problem in forensic science. We study the problem of automatically reconstructi...
SPAA
2003
ACM
15 years 4 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
102
click to vote
IEEEVAST
2010
14 years 6 months ago
2010
Co-located collaboration can be extremely valuable during complex visual analytics tasks. This paper presents an exploratory study of a system designed to support collaborative vi...
ISSAC
2005
Springer
15 years 4 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
107
click to vote
WADS
2005
Springer
15 years 4 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...