4850 search results - page 829 / 970 » Proof and Computation in Geometry |
155
click to vote
MMSEC
2006
ACM
16 years 13 days ago
2006
ACM
Current zero-knowledge watermark detectors are based on a linear correlation between the asset features and a given secret sequence. This detection function is susceptible of bein...
197
click to vote
PLDI
2006
ACM
16 years 13 days ago
2006
ACM
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
158
click to vote
SIGECOM
2006
ACM
16 years 13 days ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
161
click to vote
ICPADS
2005
IEEE
16 years 2 days ago
2005
IEEE
We show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. We show that fro...
189
click to vote
LICS
2005
IEEE
16 years 2 days ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...