Sciweavers

1139 search results - page 181 / 228
» Bounded Ideation Theory
Sort
View
GIS
2006
ACM
13 years 7 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
JSAC
2008
95views more  JSAC 2008»
13 years 7 months ago
Game Theoretic Modeling of Malicious Users in Collaborative Networks
If a network is to operate successfully, its users need to collaborate. Collaboration takes the form of following a network protocol and involves some resource expenditure on the p...
George Theodorakopoulos, John S. Baras
ENTCS
2007
98views more  ENTCS 2007»
13 years 7 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
KAIS
2006
87views more  KAIS 2006»
13 years 7 months ago
Improving the performance of 1D object classification by using the Electoral College
Abstract It has been proven that districted matching schemes (e.g., the US presidential election scheme, also called the Electoral College) are more stable than undistricted matchi...
Liang Chen, Ruoyu Chen, Sharmin Nilufar
IM
2007
13 years 7 months ago
Ranking Websites: A Probabilistic View
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
Ying Bao, Guang Feng, Tie-Yan Liu, Zhiming Ma, Yin...