Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
We propose a two-class classification model for grouping. Human segmented natural images are used as positive examples. Negative examples of grouping are constructed by randomly m...
Content-based image retrieval (CBIR) systems target database images using feature similarities with respect to the query. Our CBIR demonstration utilises novel illumination invari...
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...