Sciweavers

549 search results - page 85 / 110
» On the Complexity of Restricted k-anonymity Problem
Sort
View
CVPR
2003
IEEE
15 years 12 months ago
An Efficient Approach to Learning Inhomogeneous Gibbs Model
Inhomogeneous Gibbs model (IGM) [4] is an effective maximum entropy model in characterizing complex highdimensional distributions. However, its training process is so slow that th...
Ziqiang Liu, Hong Chen, Heung-Yeung Shum
CVPR
2008
IEEE
15 years 11 months ago
Discovering class specific composite features through discriminative sampling with Swendsen-Wang Cut
This paper proposes a novel approach to discover a set of class specific "composite features" as the feature pool for the detection and classification of complex objects...
Feng Han, Ying Shan, Harpreet S. Sawhney, Rakesh K...
ECCV
2000
Springer
15 years 11 months ago
Non-linear Bayesian Image Modelling
In recent years several techniques have been proposed for modelling the low-dimensional manifolds, or `subspaces', of natural images. Examples include principal component anal...
Christopher M. Bishop, John M. Winn
VIS
2004
IEEE
170views Visualization» more  VIS 2004»
15 years 11 months ago
Guaranteed Quality Triangulation of Molecular Skin Surfaces
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
Ho-Lun Cheng, Xinwei Shi
DAC
2002
ACM
15 years 10 months ago
A solenoidal basis method for efficient inductance extraction
The ability to compute the parasitic inductance of the interconnect is critical to the timing verification of modern VLSI circuits. A challenging aspect of inductance extraction i...
Hemant Mahawar, Vivek Sarin, Weiping Shi