Rafael Grimson

Orcid: 0000-0002-3430-0402

According to our database1, Rafael Grimson authored at least 16 papers between 2007 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
A new method for gridding passive microwave data with mixed measurements and spatial correlation.
Earth Sci. Informatics, 2020

2019
A Statistical Inverse Method for Gridding Passive Microwave Data With Mixed Measurements.
IEEE Trans. Geosci. Remote. Sens., 2019

2015
Comparison of nonlocal means despeckling based on stochastic measures.
Proceedings of the 2015 IEEE International Geoscience and Remote Sensing Symposium, 2015

2014
Some fragments of second-order logic over the reals for which satisability and equivalence are (un)decidable.
Reports Math. Log., 2014

Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies.
J. Comput. Syst. Sci., 2014

2012
Quantifier elimination for elementary geometry and elementary affine geometry.
Math. Log. Q., 2012

Evaluating geometric queries using few arithmetic operations.
Appl. Algebra Eng. Commun. Comput., 2012

2011
Efficient evaluation of specific queries in constraint databases.
Inf. Process. Lett., 2011

An analytic solution to the alibi query in the space-time prisms model for moving object data.
Int. J. Geogr. Inf. Sci., 2011

On the Expressive Power of IF-Logic with Classical Negation.
Proceedings of the Logic, Language, Information and Computation, 2011

2010
Upper and Lower Complexity Bounds for Some Problems in Elementary Geometry
PhD thesis, 2010

On the formal semantics of IF-like logics.
J. Comput. Syst. Sci., 2010

An Efficient Algorithm for the Sign Condition Problem in the Semi-algebraic Context.
Proceedings of the Advances in Geometric Modeling and Processing, 2010

2009
Some lower bounds for the complexity of the linear programming feasibility problem over the reals.
J. Complex., 2009

2007
A case study of the difficulty of quantifier elimination in constraint databases: the alibi query in moving object databases
CoRR, 2007

A lower bound for the complexity of linear optimization from a quantifier-elimination point of view.
Proceedings of the Constraint Databases, Geometric Elimination and Geographic Information Systems, 20.05., 2007


  Loading...