Sciweavers

849 search results - page 120 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 9 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
TNN
2010
234views Management» more  TNN 2010»
13 years 3 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
NIPS
2003
13 years 10 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
WWW
2011
ACM
13 years 4 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi
IWCMC
2009
ACM
14 years 1 months ago
Graph coloring based physical-cell-ID assignment for LTE networks
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
Tobias Bandh, Georg Carle, Henning Sanneck