Sciweavers

5344 search results - page 355 / 1069
» Privacy-Preserving Set Operations
Sort
View
FUIN
2007
90views more  FUIN 2007»
15 years 4 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier
103
Voted
JC
2002
50views more  JC 2002»
15 years 4 months ago
Verifying Topological Indices for Higher-Order Rank Deficiencies
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
R. Baker Kearfott, Jianwei Dian
PR
1998
86views more  PR 1998»
15 years 4 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...
TROB
2008
121views more  TROB 2008»
15 years 4 months ago
A Relational Positioning Methodology for Robot Task Specification and Execution
Abstract--This paper presents a relational positioning methodology that allows to restrict totally or partially the movements of an object by specifying its allowed positions in te...
Adolfo Rodriguez, Luis Basañez, Enric Celay...
ICPR
2010
IEEE
15 years 3 months ago
A Game-Theoretic Approach to Robust Selection of Multi-View Point Correspondence
In this paper we introduce a robust matching technique that allows to operate a very accurate selection of corresponding feature points from multiple views. Robustness is achieved...
Emanuele Rodolà, Andrea Albarelli, Andrea Torsell...