Sciweavers

4523 search results - page 26 / 905
» Using randomization in the teaching of data structures and a...
Sort
View
IJCAI
2007
13 years 10 months ago
Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
Shehroz S. Khan, Shri Kant
KES
2010
Springer
13 years 7 months ago
Extracting Principal Components from Pseudo-random Data by Using Random Matrix Theory
We develop a methodology to grasp temporal trend in a stock market that changes year to year, or sometimes within a year depending on numerous factors. For this purpose, we employ ...
Mieko Tanaka-Yamawaki
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
13 years 10 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
ICPR
2008
IEEE
14 years 2 months ago
Face super-resolution using 8-connected Markov Random Fields with embedded prior
In patch based face super-resolution method, the patch size is usually very small, and neighbor patches’ relationship via overlapped regions is only to keep smoothness of recons...
Kai Guo, Xiaokang Yang, Rui Zhang, Guangtao Zhai, ...
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
13 years 8 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...