Sciweavers

33 search results - page 5 / 7
» Canonical Partitions Of Universal Structures
Sort
View
KDD
2007
ACM
231views Data Mining» more  KDD 2007»
14 years 11 months ago
Xproj: a framework for projected structural clustering of xml documents
XML has become a popular method of data representation both on the web and in databases in recent years. One of the reasons for the popularity of XML has been its ability to encod...
Charu C. Aggarwal, Na Ta, Jianyong Wang, Jianhua F...
ICPR
2008
IEEE
15 years 2 days ago
Object localization using affine invariant substructure constraints
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...
Ahmed M. Elgammal, Ishani Chakraborty
EMMCVPR
1997
Springer
14 years 3 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
APVIS
2009
13 years 12 months ago
Correlation study of time-varying multivariate climate data sets
We present a correlation study of time-varying multivariate volumetric data sets. In most scientific disciplines, to test hypotheses and discover insights, scientists are interest...
Jeffrey Sukharev, Chaoli Wang, Kwan-Liu Ma, Andrew...
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
14 years 7 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah