417 search results - page 57 / 84 » Constructing Call Multigraphs Using Dependence Graphs |
146
click to vote
ESA
2011
Springer
13 years 11 months ago
2011
Springer
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—In road networks, sensors are deployed sparsely (hundreds of meters apart) to save costs. This makes the existing localization solutions based on the ranging be ineffect...
TACAS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. A message sequence chart (MSC) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication pro...
IJCAI
2003
15 years 1 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W to agree on a secret key R in the presence of an active ...