Sciweavers

54 search results - page 3 / 11
» Estimating the number of vertices of a polyhedron
Sort
View
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
13 years 6 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
ICCV
1995
IEEE
13 years 9 months ago
Estimating the Tensor of Curvature of a Surface from a Polyhedral Approximation
Estimating principal curvatures and principal directions of a surface from a polyhedral approximation with a large number of small faces, such as those produced by iso-surface con...
Gabriel Taubin
ICIP
2007
IEEE
14 years 7 months ago
Direct Motion Estimation in the Radon Transform Domain using Match-Profile Backprojections
Integral projections have been proposed as an efficient method to reduce the dimensionality of the search space in motion estimation (ME) algorithms. A number of papers describe m...
Chris Bartels, Gerard de Haan
DM
2006
124views more  DM 2006»
13 years 6 months ago
Hall ratio of the Mycielski graphs
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
Mathew Cropper, András Gyárfá...
TIP
2011
124views more  TIP 2011»
13 years 1 months ago
A Geometric Method for Optimal Design of Color Filter Arrays
—A color filter array (CFA) used in a digital camera is a mosaic of spectrally selective filters, which allows only one color component to be sensed at each pixel. The missing ...
Pengwei Hao, Yan Li, Zhouchen Lin, Eric Dubois