1972 search results - page 160 / 395 » connection 2008 |
180
Voted
ECCC
2008
15 years 6 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
132
click to vote
ECEASST
2008
15 years 6 months ago
2008
: We study directed bigraph with negative ports, a bigraphical framework for representing models for distributed, concurrent and ubiquitous computing. With respect to previous vers...
174
click to vote
EJC
2008
15 years 6 months ago
2008
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
173
click to vote
ENTCS
2008
15 years 6 months ago
2008
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
125
click to vote
ESWA
2008
15 years 6 months ago
2008
In this paper, we present samap, whose goal is to build a software tool to help different people visit different cities. This tool integrates modules that dynamically capture user...