Sciweavers

1730 search results - page 217 / 346
» Algebra and Computation
Sort
View
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 4 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
SIAMSC
2008
148views more  SIAMSC 2008»
15 years 4 months ago
Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
A multilevel adaptive aggregation method for calculating the stationary probability vector of an irreducible stochastic matrix is described. The method is a special case of the ada...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
SAC
2002
ACM
15 years 3 months ago
Semi-automatic design of agent organisations
Designing realistic multi-agent systems is a complex process, which involves specifying not only the functionality of individual agents, but also the authority relationships and l...
Anthony Karageorgos, Simon G. Thompson, Nikolay Me...
ESORICS
2010
Springer
15 years 5 months ago
Verifying Security Property of Peer-to-Peer Systems Using CSP
Due to their nature, Peer-to-Peer (P2P) systems are subject to a wide range of security issues. In this paper, we focus on a specific security property, called the root authenticit...
Tien Tuan Anh Dinh, Mark Ryan
DAM
2011
14 years 11 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès