Sciweavers

3154 search results - page 52 / 631
» Computing Closed Skycubes
Sort
View
ICCSA
2004
Springer
14 years 2 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
ICRA
2000
IEEE
109views Robotics» more  ICRA 2000»
14 years 1 months ago
Computing the Sensory Uncertainty Field of a Vision-Based Localization Sensor
—Recently it has been recognized that robust motion planners should take into account the varying performance of localization sensors across the configuration space. Although a n...
Amit Adam, Ehud Rivlin, Ilan Shimshoni
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 9 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
CORR
2008
Springer
82views Education» more  CORR 2008»
13 years 9 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
CHI
2011
ACM
13 years 15 days ago
MonoTrans2: a new human computation system to support monolingual translation
In this paper, we present MonoTrans2, a new user interface to support monolingual translation; that is, translation by people who speak only the source or target language, but not...
Chang Hu, Benjamin B. Bederson, Philip Resnik, Yak...