36 search results - page 6 / 8 » Some Properties of Digital Covering Spaces |
SIGECOM
2009
ACM
14 years 4 months ago
2009
ACM
We study protocols to enable one user (the principal) to make potentially profitable but risky interactions with another user (the agent), in the absence of direct trust between ...
SIAMJO
2002
13 years 9 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
RSA
2010
13 years 8 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
DOCENG
2005
ACM
13 years 11 months ago
2005
ACM
This paper presents a new approach to text processing, based on textemes. These are atomic text units generalising the concepts of character and glyph by merging them in a common ...
MOBIHOC
2008
ACM
14 years 9 months ago
2008
ACM
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...