Sciweavers

900 search results - page 9 / 180
» Metric Structures and Probabilistic Computation
Sort
View
IJCNLP
2005
Springer
14 years 1 months ago
Using the Structure of a Conceptual Network in Computing Semantic Relatedness
Abstract. We present a new method for computing semantic relatedness of concepts. The method relies solely on the structure of a conceptual network and eliminates the need for perf...
Iryna Gurevych
ECML
2007
Springer
14 years 1 months ago
Learning Metrics Between Tree Structured Data: Application to Image Recognition
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
Laurent Boyer 0002, Amaury Habrard, Marc Sebban
SCIA
2009
Springer
199views Image Analysis» more  SCIA 2009»
14 years 2 months ago
Appearance Based Extraction of Planar Structure in Monocular SLAM
This paper concerns the building of enhanced scene maps during real-time monocular SLAM. Specifically, we present a novel algorithm for detecting and estimating planar structure i...
José Martínez-Carranza, Andrew Calwa...
DCC
1999
IEEE
13 years 12 months ago
Complexity-Distortion Tradeoffs in Vector Matching Based on Probabilistic Partial Distance Techniques
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
Krisda Lengwehasatit, Antonio Ortega
ENTCS
2007
85views more  ENTCS 2007»
13 years 7 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch