Short search engine queries do not provide contextual information, making it difficult for traditional search engines to understand what users are really requesting. One approach ...
Ajith Kodakateri Pudhiyaveetil, Susan Gauch, Hiep ...
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
—A number of protocols and mechanisms have been proposed to address the problem of initial secure key deployment in wireless networks. Most existing approaches work either with a...
Toni Perkovic, Mario Cagalj, Toni Mastelic, Nitesh...