Sciweavers

3006 search results - page 419 / 602
» Dimensionality reduction and generalization
Sort
View
QEST
2006
IEEE
16 years 17 days ago
Exploring correctness and accuracy of solutions to matrix polynomial equations in queues
Spectral expansion and matrix analytic methods are important solution mechanisms for matrix polynomial equations. These equations are encountered in the steady-state analysis of M...
David Thornley, Harf Zatschler
NECO
2006
111views more  NECO 2006»
15 years 6 months ago
Dynamics and Topographic Organization of Recursive Self-Organizing Maps
Recently, there has been an outburst of interest in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, at present, ...
Peter Tiño, Igor Farkas, Jort van Mourik
JMLR
2010
179views more  JMLR 2010»
15 years 1 months ago
PAC-Bayesian Analysis of Co-clustering and Beyond
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
Yevgeny Seldin, Naftali Tishby
TCC
2009
Springer
117views Cryptology» more  TCC 2009»
16 years 7 months ago
Towards a Theory of Extractable Functions
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
Ran Canetti, Ronny Ramzi Dakdouk
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 6 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen