We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Wireless sensor networks have many applications, vary in size, and are deployed in a wide variety of areas. They are often deployed in potentially adverse or even hostile environm...
Yang Xiao, Venkata Krishna Rayi, Bo Sun, Xiaojiang...
The problem of content based image retrieval (CBIR) has traditionally been investigated within a framework that emphasises the explicit formulation of a query: users initiate an au...
Multiagent systems are rapidly finding applications in a variety of domains, including robotics, distributed control, telecommunications, and economics. The complexity of many task...
With the phenomenal growth of the Internet and open networks in general, security services, such as non-repudiation, become crucial to many applications. Nonrepudiation services m...