Mobile Adhoc networks are infra structure-less and are categorized by multi-hop wireless connectivity and dynamic changing network topology. They are self organized networks without dependency on any fixed infrastructure. Application area of MANET is varied, ranging from small, static networks to large scale highly mobile and highly dynamic networks. Routing is an important issue in wireless ad...

Recently, there is a surge of interests on heterogeneous information network analysis. As a newly emerging network model, heterogeneous information networks have many unique features (e.g., complex structure and rich semantics) and a number of interesting data mining tasks have been exploited in this kind of networks, such as similarity measure, clustering, and classification. Although evaluati...

A new morphological operator, namely RORPO (Ranking Orientation Responses of Path Operators), was recently introduced as a semi-global, morphological alternative to the local, Hessian-based operators for thin structure filtering in 3D images. In this context, a previous study has already provided experimental proof of its relevance by comparison to such differential operators. In this article, ...

Thin objects in 3D volumes, for instance vascular networks in medical imaging or various kinds of fibres in materials science, have been of interest for some time to computer vision. Particularly, tubular objects are everywhere elongated in one principal direction – which varies spatially – and are thin in the other two perpendicular directions. Filters for detecting such structures use for ins...

Knowledge base (KB) completion aims to infer missing facts from existing ones in a KB. Among various approaches, path ranking (PR) algorithms have received increasing attention in recent years. PR algorithms enumerate paths between entitypairs in a KB and use those paths as features to train a model for missing fact prediction. Due to their good performances and high model interpretability, sev...

Existing works on keyword search over relational databases typically do not consider users’ search intention for a query and return many answers which often overwhelm users. We observe that a database is in fact a repository of real world objects that interact with each other via relationships. In this work, we identify four types of semantic paths between objects and design an algorithm called...

Recent work has presented theoretical frameworks that rigorously model the behavior of path-vector protocols [6, 7, 13], which are primarily used for inter-domain routing on the Internet. We expand the scope of these to include protocols with route-selection procedures that cannot be captured by a per-node linear order on paths; in particular, our generalized model captures the use of commonly ...

The Shortest path problem is a classical network optimisation problem which has wide range of applications in various fields. In this work, we study the task of finding the shortest path in fuzzy weighted graph (network) i.e., vertices remains crisp, but the edge weights will be of fuzzy numbers. It has been proposed to present new algorithms for finding the shortest path in fuzzy sense where i...

Automatic segmentation of cardiac MRI is an important but challenging task in clinical study of cardiac morphology. Recently, fusing segmentations from multiple classifiers has been shown to achieve more accurate results than a single classifier. In this work, we propose a new strategy, MUltiple Path Propagation and Segmentation (MUPPS), in contrast with the currently widely used multi-atlas pr...

In this paper, we present a new algorithm for solving the multi-objective shortest path problem (MSPP) which consists of finding all the non-dominated paths between two nodes s and t (ND s-t paths), on a network where a multiple criteria function is defined over the set of arcs. The main feature of the algorithm is that, contrarily to the previous most efficient approaches for the MSPP, not all...