Sciweavers

19 search results - page 1 / 4
» The Computability Path Ordering: The End of a Quest
Sort
View
CSL
2008
Springer
13 years 5 months ago
The Computability Path Ordering: The End of a Quest
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
Frédéric Blanqui, Jean-Pierre Jouann...
ICDE
2010
IEEE
247views Database» more  ICDE 2010»
14 years 3 months ago
Efficient Verification of Shortest Path Search via Authenticated Hints
Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanni...
Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis
ICC
2007
IEEE
106views Communications» more  ICC 2007»
13 years 10 months ago
A Distributed Approach to End-to-End Network Topology Inference
Abstract— To construct an efficient overlay network, the information of underlay is important. However, the inference of an underlay topology is not easy. We consider using end-...
Xing Jin, Qiuyan Xia, Shueng-Han Gary Chan
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 3 months ago
Pushdown Control-Flow Analysis of Higher-Order Programs
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...
Christopher Earl, Matthew Might, David Van Horn
ECCV
2006
Springer
14 years 5 months ago
Geodesics Between 3D Closed Curves Using Path-Straightening
In order to analyze shapes of continuous curves in R3 , we parameterize them by arc-length and represent them as curves on a unit two-sphere. We identify the subset denoting the cl...
Eric Klassen, Anuj Srivastava