Sciweavers

1285 search results - page 135 / 257
» On the Complexity of Ordinal Clustering
Sort
View
ICDM
2008
IEEE
155views Data Mining» more  ICDM 2008»
14 years 4 months ago
Organic Pie Charts
We present a new visualization of the distance and cluster structure of high dimensional data. It is particularly well suited for analysis tasks of users unfamiliar with complex d...
Fabian Mörchen
IDA
2007
Springer
14 years 4 months ago
Compact and Understandable Descriptions of Mixtures of Bernoulli Distributions
Abstract. Finite mixture models can be used in estimating complex, unknown probability distributions and also in clustering data. The parameters of the models form a complex repres...
Jaakko Hollmén, Jarkko Tikka
ICNC
2005
Springer
14 years 3 months ago
A Multi-cluster Grid Enabled Evolution Framework for Aerodynamic Airfoil Design Optimization
Advances in grid computing have recently sparkled the research and development of Grid problem solving environments for complex design. Parallelism in the form of distributed compu...
Hee-Khiang Ng, Dudy Lim, Yew-Soon Ong, Bu-Sung Lee...
CASES
2004
ACM
14 years 3 months ago
A low power architecture for embedded perception
Recognizing speech, gestures, and visual features are important interface capabilities for future embedded mobile systems. Unfortunately, the real-time performance requirements of...
Binu K. Mathew, Al Davis, Michael Parker
IPPS
1998
IEEE
14 years 2 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky