Sciweavers

236 search results - page 36 / 48
» Binary Partitions Revisited
Sort
View
CVPR
2006
IEEE
14 years 11 months ago
A Design Principle for Coarse-to-Fine Classification
Coarse-to-fine classification is an efficient way of organizing object recognition in order to accommodate a large number of possible hypotheses and to systematically exploit shar...
Sachin Gangaputra, Donald Geman
GIS
2006
ACM
14 years 10 months ago
Optimal BSPs and rectilinear cartograms
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a par...
Mark de Berg, Elena Mumford, Bettina Speckmann
ICML
2004
IEEE
14 years 10 months ago
Parameter space exploration with Gaussian process trees
Computer experiments often require dense sweeps over input parameters to obtain a qualitative understanding of their response. Such sweeps can be prohibitively expensive, and are ...
Robert B. Gramacy, Herbert K. H. Lee, William G. M...
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
14 years 6 months ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou
SI3D
2010
ACM
14 years 4 months ago
Parallel Banding Algorithm to compute exact distance transform with the GPU
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...
Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng T...