Sciweavers

298 search results - page 17 / 60
» ideal 2010
Sort
View
CCS
2010
ACM
14 years 7 months ago
Secure encounter-based social networks: requirements, challenges, and designs
In this paper we outline requirements, challenges, and designs for encounter-based mobile social networks, where relationships are based on a temporarily shared location. To illus...
Abedelaziz Mohaisen, Eugene Y. Vasserman, Max Schu...
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
15 years 7 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger
SOFSEM
2010
Springer
15 years 6 months ago
A Social Vision of Knowledge Representation and Reasoning
Knowledge representation and reasoning so far have focused on the ideal ultimate goal, thus stressing logical consistency and semantic homogeneity. On the way to consistent and hom...
François Bry, Jakub Kotowski
DCC
2010
IEEE
15 years 4 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro
SAC
2010
ACM
15 years 4 months ago
Design of a market-based mechanism for quality attribute tradeoff of services in the cloud
Cloud computing, with its promise of (almost) unlimited computation, storage and bandwidth, is increasingly becoming the infrastructure of choice for many organizations. As applic...
Vivek Nallur, Rami Bahsoon