Sciweavers

2436 search results - page 256 / 488
» Comonadic Notions of Computation
Sort
View
ASPLOS
1998
ACM
15 years 11 months ago
Accelerating Multi-Media Processing by Implementing Memoing in Multiplication and Division Units
This paper proposes a technique that enables performing multi-cycle (multiplication, division, square-root ...) computations in a single cycle. The technique is based on the notio...
Daniel Citron, Dror G. Feitelson, Larry Rudolph
EMMCVPR
2007
Springer
15 years 10 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
177
Voted
DIS
2009
Springer
15 years 10 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
POPL
1990
ACM
15 years 10 months ago
Concurrent Constraint Programming
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
Vijay A. Saraswat, Martin C. Rinard