ICDT
2010
ACM
13 years 8 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
TVCG
2008
13 years 9 months ago
2008
A curve skeleton is a compact representation of 3D objects and has numerous applications. It can be used to describe an object's geometry and topology. In this paper, we intro...
TVCG
2008
13 years 9 months ago
2008
TSMC
2008
13 years 9 months ago
2008
In the fuzzy c-means (FCM) clustering algorithm,
TFS
2008
13 years 9 months ago
2008
Abstract--This study proposes an efficient self-evolving evolutionary learning algorithm (SEELA) for neurofuzzy inference systems (NFISs). The major feature of the proposed SEELA i...
SCFBM
2008
13 years 9 months ago
2008
The main problem in any model-building situation is to choose from a large set of covariates those that should be included in the "best" model. A decision to keep a vari...
SAC
2008
ACM
13 years 9 months ago
2008
ACM
A key benefit of generic programming is its support for producing modules with clean separation. In particular, generic algorithms are written to work with a wide variety of unmod...
PVLDB
2008
13 years 9 months ago
2008
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data inte...
MVA
2008
13 years 9 months ago
2008
This paper describes a new method for temporally calibrating multiple cameras by image processing operations. Existing multi-camera algorithms assume that the input sequences are ...
PRL
2007
13 years 9 months ago
2007
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...