2693 search results - page 138 / 539 » On Computing Complex Navigation Functions |
103
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
A number of software packages are available for the construction of comprehensive human genetic maps. In this paper we parallelize the widely used package Genehunter. We restrict ...
132
Voted
NSF
1994
Springer
15 years 6 months ago
1994
Springer
The goal of algebraic geometry is to gain an understanding of the behaviour of functions related by polynomial relationships. Algebraic curves and surfaces having considerable adva...
103
Voted
AMC
2007
15 years 2 months ago
2007
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
102
Voted
PERCOM
2008
ACM
16 years 2 months ago
2008
ACM
This paper identifies requirements for querying and accessing context information in mobile and pervasive computing environments. Furthermore it studies existing query languages s...
120
click to vote
TACAS
2009
Springer
15 years 9 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...