Sciweavers

2654 search results - page 209 / 531
» On Pairing Inversion Problems
Sort
View
CCIA
2007
Springer
16 years 20 days ago
Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...
Martí Sánchez, Simon de Givry, Thoma...
CVPR
2006
IEEE
16 years 8 months ago
Homography from Coplanar Ellipses with Application to Forensic Blood Splatter Reconstruction
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...
John Wright, Andrew Wagner, Shankar Rao, Yi Ma
SPAA
2003
ACM
15 years 11 months ago
Online oblivious routing
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...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
IEEEVAST
2010
15 years 1 months ago
An exploratory study of co-located collaborative visual analytics around a tabletop display
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...
Petra Isenberg, Danyel Fisher, Meredith Ringel Mor...
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
15 years 12 months ago
Half-GCD and fast rational recovery
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...
Daniel Lichtblau