Sciweavers

1272 search results - page 130 / 255
» The Set Cover with Pairs Problem
Sort
View
JEI
2007
79views more  JEI 2007»
13 years 10 months ago
Stereo matching via selective multiple windows
Window-based correlation algorithms are widely used for stereo matching due to their computational efficiency as compared to global algorithms. In this paper, a multiple window co...
Satyajit Anil Adhyapak, Nasser D. Kehtarnavaz, Mih...
PVLDB
2008
123views more  PVLDB 2008»
13 years 10 months ago
Propagating functional dependencies with conditions
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, Yinghui W...
CCIA
2007
Springer
14 years 5 months 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...
ISAAC
2009
Springer
78views Algorithms» more  ISAAC 2009»
14 years 5 months ago
Reconstructing Polygons from Scanner Data
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
Therese C. Biedl, Stephane Durocher, Jack Snoeyink
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 3 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum