Sciweavers

284 search results - page 52 / 57
» What Matchings Can Be Stable
Sort
View
INFOCOM
2008
IEEE
14 years 4 months ago
The Inframetric Model for the Internet
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...
ESCIENCE
2007
IEEE
14 years 4 months ago
Decentralised Resource Discovery Service for Large Scale Federated Grids
Efficient Resource discovery mechanism is one of the fundamental requirement for Grid computing systems, as it aids in resource management and scheduling of applications. Resourc...
Rajiv Ranjan, Lipo Chan, Aaron Harwood, Shanika Ka...
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
14 years 3 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
ICCAD
1999
IEEE
81views Hardware» more  ICCAD 1999»
14 years 2 months ago
Modeling design constraints and biasing in simulation using BDDs
Constraining and input biasing are frequently used techniques in functional verification methodologies based on randomized simulation generation. Constraints confine the simulatio...
Jun Yuan, Kurt Shultz, Carl Pixley, Hillel Miller,...
MPC
2010
Springer
174views Mathematics» more  MPC 2010»
14 years 1 months ago
Matrices as Arrows!
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
Hugo Daniel Macedo, José Nuno Oliveira