Sciweavers

5599 search results - page 1085 / 1120
» Abstract State Services
Sort
View
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 6 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
INFOCOM
2011
IEEE
14 years 3 months ago
Taming user-generated content in mobile networks via Drop Zones
Abstract—Smartphones have changed the way people communicate. Most prominently, using commonplace mobile device features (e.g., high resolution cameras), they started producing a...
Ionut Trestian, Supranamaya Ranjan, Aleksandar Kuz...
ASPLOS
2011
ACM
14 years 3 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
14 years 2 months ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...
DC
2011
13 years 11 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
« Prev « First page 1085 / 1120 Last » Next »