Sciweavers

1648 search results - page 139 / 330
» Where to Build a Door
Sort
View
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 10 months ago
Report on the XBase Project
This project addressed the conceptual fundamentals of data storage, investigating techniques for provision of highly generic storage facilities that can be tailored to produce var...
Evangelos Zirintsis, Graham N. C. Kirby, Alan Dear...
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
13 years 12 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...
INFOCOM
2010
IEEE
13 years 8 months ago
Socially-Aware Network Design Games
—In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wh...
Jocelyne Elias, Fabio Martignon, Konstantin Avrach...
CN
2011
127views more  CN 2011»
13 years 5 months ago
A game theoretic analysis of network design with socially-aware users
In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wher...
Jocelyne Elias, Fabio Martignon, Konstantin Avrach...
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
12 years 13 days ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...