Sciweavers

4085 search results - page 428 / 817
» Benchmarking Data Mining Algorithms
Sort
View
151
Voted
JPDC
2007
177views more  JPDC 2007»
15 years 5 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
TSMC
2011
324views more  TSMC 2011»
14 years 12 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
15 years 6 months ago
Semi-Supervised Learning Based on Semiparametric Regularization
Semi-supervised learning plays an important role in the recent literature on machine learning and data mining and the developed semisupervised learning techniques have led to many...
Zhen Guo, Zhongfei (Mark) Zhang, Eric P. Xing, Chr...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 7 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
ICIP
2006
IEEE
16 years 6 months ago
A Probabilistic Approach to Robust Shape Matching
We present a probabilistic approach to shape matching which is invariant to rotation, translation and scaling. Shapes are represented by unlabeled point sets, so discontinuous bou...
Graham McNeill, Sethu Vijayakumar