Sciweavers

1172 search results - page 34 / 235
» Approximate Reasoning Based on Similarity
Sort
View
KR
1992
Springer
14 years 1 months ago
Learning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
Russell Greiner, Dale Schuurmans
NOMS
2010
IEEE
177views Communications» more  NOMS 2010»
13 years 7 months ago
An effective similarity metric for application traffic classification
—Application level traffic classification is one of the major issues in network monitoring and traffic engineering. In our previous study, we proposed a new traffic classificatio...
Jae Yoon Chung, Byungchul Park, Young J. Won, John...
CICLING
2009
Springer
13 years 10 months ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...
GIS
2010
ACM
13 years 7 months ago
Finding similar users using category-based location history
In this paper, we aim to estimate the similarity between users according to their GPS trajectories. Our approach first models a user’s GPS trajectories with a semantic location ...
Xiangye Xiao, Yu Zheng, Qiong Luo, Xing Xie
TALG
2010
101views more  TALG 2010»
13 years 7 months ago
Reasoning about online algorithms with weighted automata
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
Benjamin Aminof, Orna Kupferman, Robby Lampert