Sciweavers

895 search results - page 93 / 179
» Using graphs for some discrete tomography problems
Sort
View
PPAM
2005
Springer
15 years 3 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
FUIN
2006
139views more  FUIN 2006»
14 years 10 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
BMVC
1998
14 years 11 months ago
Colour Profiling Using Multiple Colour Spaces
This paper presents an original method using colour histograms for flaw detection in automated industrial inspection. The colour histogram of an image is constructed by mapping th...
Nicola Duffy, Gerard Lacey
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 1 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
COMPGEOM
2004
ACM
15 years 3 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen