Sciweavers

7978 search results - page 786 / 1596
» Combining shared-coin algorithms
Sort
View
KDD
2009
ACM
174views Data Mining» more  KDD 2009»
16 years 2 months ago
Visual exploration of categorical and mixed data sets
For categorical data there does not exist any similarity measure which is as straight forward and general as the numerical distance between numerical items. Due to this it is ofte...
Sara Johansson
SASP
2009
IEEE
170views Hardware» more  SASP 2009»
16 years 2 months ago
Parade: A versatile parallel architecture for accelerating pulse train clustering
— In this paper, we present Parade, a novel and flexible parallel architecture for the deinterleaving of combined pulsetrains. This is a commonly performed task in various areas ...
Amin Ansari, Dan Zhang, Scott A. Mahlke
IDA
2009
Springer
16 years 2 months ago
How to Control Clustering Results? Flexible Clustering Aggregation
One of the most important and challenging questions in the area of clustering is how to choose the best-fitting algorithm and parameterization to obtain an optiml clustering for t...
Martin Hahmann, Peter Benjamin Volk, Frank Rosenth...
IVA
2009
Springer
16 years 2 months ago
Augmenting Gesture Animation with Motion Capture Data to Provide Full-Body Engagement
Abstract. Effective speakers engage their whole body when they gesture. It is difficult, however, to create such full body motion in animated agents while still supporting a large...
Pengcheng Luo, Michael Kipp, Michael Neff
MDM
2009
Springer
126views Communications» more  MDM 2009»
16 years 2 months ago
Outlier Detection in Ad Hoc Networks Using Dempster-Shafer Theory
Mobile Ad-hoc NETworks (MANETs) are known to be vulnerable to a variety of attacks due to lack of central authority or fixed network infrastructure. Many security schemes have bee...
Wenjia Li, Anupam Joshi