3052 search results - page 95 / 611 » Weakly Distributive Domains |
150
click to vote
MM
2006
ACM
15 years 10 months ago
2006
ACM
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
145
Voted
SMA
2003
ACM
15 years 9 months ago
2003
ACM
Associativity between feature models implies the automatic updating of different feature models of a part after changes are made in one of its feature models. This is an importan...
160
click to vote
USS
2010
15 years 1 months ago
2010
Secure multiparty computation (MPC) allows joint privacy-preserving computations on data of multiple parties. Although MPC has been studied substantially, building solutions that ...
197
Voted
CANDC
2011
ACM
14 years 4 months ago
2011
ACM
This paper describes a computerized aesthetic composition task that is based on a “creativity as search” metaphor. The technique collects detailed, moment-to-moment data about...
146
click to vote
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
The use of quantum bits (qubits) in cryptography holds the promise of secure cryptographic quantum key distribution schemes. Unfortunately, the implemented schemes are often operat...