Sciweavers

1085 search results - page 132 / 217
» On the performance of one-to-many data transformations
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 9 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
DKE
2010
167views more  DKE 2010»
13 years 6 months ago
Discovering private trajectories using background information
Trajectories are spatio-temporal traces of moving objects which contain valuable information to be harvested by spatio-temporal data mining techniques. Applications like city traf...
Emre Kaplan, Thomas Brochmann Pedersen, Erkay Sava...
IHI
2010
198views Healthcare» more  IHI 2010»
13 years 3 months ago
Large-scale multimodal mining for healthcare with mapreduce
Recent advances in healthcare and bioscience technologies and proliferation of portable medical devices are producing massive amounts of multimodal data. The need for parallel pro...
Fei Wang, Vuk Ercegovac, Tanveer Fathima Syeda-Mah...
IVC
2007
176views more  IVC 2007»
13 years 9 months ago
Kernel-based distance metric learning for content-based image retrieval
ct 8 For a specific set of features chosen for representing images, the performance of a content-based image retrieval (CBIR) system 9 depends critically on the similarity or diss...
Hong Chang, Dit-Yan Yeung
RT
1998
Springer
14 years 1 months ago
A New Change of Variables for Efficient BRDF Representation
We describe an idea for making decomposition of Bidirectional Reflectance Distribution Functions into basis functions more efficient, by performing a change-of-variables transform...
Szymon Rusinkiewicz