1871 search results - page 202 / 375 » The Ephemeral Pairing Problem |
148
click to vote
ICDCS
2005
IEEE
16 years 6 days ago
2005
IEEE
We consider the problem of sending messages into the future, commonly known as timed release cryptography. Existing schemes for this task either solve the relative time problem wi...
175
click to vote
WABI
2005
Springer
16 years 2 days ago
2005
Springer
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
155
click to vote
WEBI
2005
Springer
16 years 2 days ago
2005
Springer
One of the principal problems of online help is the mismatch between the specialized knowledge and technical vocabulary of experts who are providing the help, and the relative na...
154
click to vote
COMPGEOM
2004
ACM
16 years 21 hour ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
177
click to vote
NMR
2004
Springer
15 years 12 months ago
2004
Springer
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...