Sciweavers

9631 search results - page 187 / 1927
» The Costs of Using JXTA
Sort
View
WECWIS
2005
IEEE
137views ECommerce» more  WECWIS 2005»
16 years 6 days ago
Using Singular Value Decomposition Approximation for Collaborative Filtering
Singular Value Decomposition (SVD), together with the Expectation-Maximization (EM) procedure, can be used to find a low-dimension model that maximizes the loglikelihood of obser...
Sheng Zhang, Weihong Wang, James Ford, Fillia Make...
166
Voted
ICDM
2003
IEEE
112views Data Mining» more  ICDM 2003»
15 years 12 months ago
Privacy-preserving Distributed Clustering using Generative Models
We present a framework for clustering distributed data in unsupervised and semi-supervised scenarios, taking into account privacy requirements and communication costs. Rather than...
Srujana Merugu, Joydeep Ghosh
CHES
2001
Springer
193views Cryptology» more  CHES 2001»
15 years 11 months ago
Preventing SPA/DPA in ECC Systems Using the Jacobi Form
Abstract. In this paper we show how using a representation of an elliptic curve as the intersection of two quadrics in P3 can provide a defence against Simple and Differental Powe...
Pierre-Yvan Liardet, Nigel P. Smart
CVPR
2009
IEEE
15 years 10 months ago
Efficient image alignment using linear appearance models
Visual tracking is a key component in many computer vision applications. Linear subspace techniques (e.g. eigentracking) are one of the most popular approaches to align templates ...
Jose Gonzalez-Mora, Nicolas Guil, Emilio L. Zapata...
ICASSP
2010
IEEE
15 years 6 months ago
Partial sequence matching using an Unbounded Dynamic Time Warping algorithm
Before the advent of Hidden Markov Models(HMM)-based speech recognition, many speech applications were built using pattern matching algorithms like the Dynamic Time Warping (DTW) ...
Xavier Anguera, Robert Macrae, Nuria Oliver