441 search results - page 81 / 89 » Generic Timing Fault Tolerance using a Timely Computing Base |
AVBPA
2005
Springer
14 years 1 months ago
2005
Springer
Due to their very small contact areas and low cost, swipe fingerprint sensors provide the very convenient and reliable fingerprint security solutions and are being increasingly u...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
Characterizing mobility or contact patterns in a campus environment is of interest for a variety of reasons. Existing studies of these patterns can be classified into two basic a...
AAAI
2012
11 years 10 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...