Sciweavers

3575 search results - page 228 / 715
» Presentations of computably enumerable reals
Sort
View
IPPS
1999
IEEE
15 years 11 months ago
Application Performance of a Linux Cluster Using Converse
Abstract. Clusters of PCs are an attractive platform for parallel applications because of their cost effectiveness. We have implemented an interoperable runtime system called Conve...
Laxmikant V. Kalé, Robert Brunner, James C....
CAIP
1997
Springer
155views Image Analysis» more  CAIP 1997»
15 years 10 months ago
Discrete-Time Rigidity-Constrained Optical Flow
An algorithm for optical ow estimation is presented for the case of discrete-time motion of an uncalibrated camera through a rigid world. Unlike traditional optical ow approaches t...
Jeffrey Mendelsohn, Eero P. Simoncelli, Ruzena Baj...
GI
2007
Springer
15 years 10 months ago
Modelling of Rowing Dynamics Using Mixed Reality Bond Graphs
: The aim of this paper is to present a modelling of rowing dynamics using bond graphs and to replace it by a modelling of mixed reality rowing dynamics using Mixed Reality Bond Gr...
Yong-Hoo Yoo
FOCS
2004
IEEE
15 years 10 months ago
Testing Low-Degree Polynomials over Prime Fields
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra...
TCS
2008
15 years 6 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi