Sciweavers

2600 search results - page 17 / 520
» Clustering with or without the Approximation
Sort
View
APPT
2005
Springer
14 years 1 months ago
Principal Component Analysis for Distributed Data Sets with Updating
Identifying the patterns of large data sets is a key requirement in data mining. A powerful technique for this purpose is the principal component analysis (PCA). PCA-based clusteri...
Zheng-Jian Bai, Raymond H. Chan, Franklin T. Luk
GMP
2008
IEEE
162views Solid Modeling» more  GMP 2008»
13 years 8 months ago
Cutting and Fracturing Models without Remeshing
Afiniteelement simulationframeworkforcuttingand fracturing model without remeshing is presented. The main idea of proposed method is adding a discontinuous function for the standa...
Chao Song, Hongxin Zhang, Yuan Wu, Hujun Bao
IACR
2011
146views more  IACR 2011»
12 years 7 months ago
Identity-based Digital Signature Scheme Without Bilinear Pairings
: Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher th...
Debiao He, Jianhua Chen, Jin Hu
ICML
2009
IEEE
14 years 2 months ago
Learning linear dynamical systems without sequence information
Virtually all methods of learning dynamic systems from data start from the same basic assumption: that the learning algorithm will be provided with a sequence, or trajectory, of d...
Tzu-Kuo Huang, Jeff Schneider
VLDB
1997
ACM
112views Database» more  VLDB 1997»
13 years 11 months ago
Selectivity Estimation Without the Attribute Value Independence Assumption
The result size of a query that involves multiple attributes from the same relation depends on these attributes’ joint data distribution,i.e., the frequencies of all combination...
Viswanath Poosala, Yannis E. Ioannidis