Sciweavers

1051 search results - page 109 / 211
» On the Correspondence between Approximations and Similarity
Sort
View
ACL
1998
15 years 7 months ago
A Flexible Example-Based Parser Based on the SSTC
In this paper we sketch an approach for Natural Language parsing. Our approach is an example-based approach, which relies mainly on examples that already parsed to their represent...
Mosleh Hmoud Al-Adhaileh, Tang Enya Kong
ENGL
2007
94views more  ENGL 2007»
15 years 6 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna
TASLP
2008
141views more  TASLP 2008»
15 years 6 months ago
Unsupervised Pattern Discovery in Speech
We present a novel approach to speech processing based on the principle of pattern discovery. Our work represents a departure from traditional models of speech recognition, where t...
A. S. Park, J. R. Glass
COMSNETS
2012
168views more  COMSNETS 2012»
14 years 2 months ago
Limitations of scanned human copresence encounters for modelling proximity-borne malware
—Patterns of human encounters, which are difficult to observe directly, are fundamental to the propagation of mobile malware aimed at infecting devices in spatial proximity. We ...
James Mitchell, Eamonn O'Neill, Gjergji Zyba, Geof...
CVPR
2012
IEEE
13 years 8 months ago
Robust non-rigid registration of 2D and 3D graphs
We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...
Eduard Serradell, Przemyslaw Glowacki, Jan Kybic, ...