492 search results - page 80 / 99 » The number of possibilities for random dating |
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
TCC
2007
Springer
14 years 2 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
IVA
2005
Springer
14 years 2 months ago
2005
Springer
this is via the ”Motion Abstraction”. This is a single abstraction that represents any type of animation of a character. Different implementations of the ion can provide very ...
CTRSA
2009
Springer
14 years 20 days ago
2009
Springer
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
TOG
2008
13 years 8 months ago
2008
We introduce 4PCS, a fast and robust alignment scheme for 3D point sets that uses wide bases, which are known to be resilient to noise and outliers. The algorithm allows registeri...