Sciweavers

670 search results - page 29 / 134
» Intractability and clustering with constraints
Sort
View
ICCAD
2003
IEEE
124views Hardware» more  ICCAD 2003»
15 years 6 months ago
Gradual Relaxation Techniques with Applications to Behavioral Synthesis
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
Zhiru Zhang, Yiping Fan, Miodrag Potkonjak, Jason ...
AAAI
1992
14 years 11 months ago
Causal Approximations
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
P. Pandurang Nayak
CVPR
2009
IEEE
16 years 4 months ago
Constrained Clustering via Spectral Regularization
We propose a novel framework for constrained spectral clustering with pairwise constraints which specify whether two objects belong to the same cluster or not. Unlike previous m...
Zhenguo Li (The Chinese University of Hong Kong), ...
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
FLAIRS
2004
14 years 11 months ago
Clustering Spatial Data in the Presence of Obstacles
Clustering is a form of unsupervised machine learning. In this paper, we proposed the DBRS_O method to identify clusters in the presence of intersected obstacles. Without doing an...
Xin Wang, Howard J. Hamilton