Search Results

Information Retrieval (IR) provides access to unstructured data to satisfy user information needs within an extensive collection. In probabilistic IR models, the probability of an N-gram query is estimated by increasing the background ...

• Providing a comprehensive study on ranking models in text information retrieval.

• In this paper, we consider the problem of finding a Hamiltonian cycle for truncated rectangular grid graphs.

The Hamiltonian cycle problem is an important problem in graph theory. For solid grid graphs, an O ( n 4 )-time algorithm has been given. In this paper, we solve the problem for a special class of solid grid graphs, i.e. truncated ...

The chromatic orthogonal art gallery problem is a well-known problem in the computational geometry. Two points in an orthogonal polygon P see each other if there is an axis-aligned rectangle inside P contains them. An orthogonal guarding of P is k-...$\mathrm{}$

Influence maximization (IM) problem, a fundamental algorithmic problem, is the problem of selecting a set of k users (refer as seed set) from a social network to maximize the expected number of influenced users (also known as influence spread). ...

The longest and Hamiltonian path problems are well-known NP-hard problems in graph theory. Despite many applications of these problems, they are still open for many classes of graphs, including solid grid graphs and grid graphs with ...

Internet of Things (IoT) is turning into an essential part of daily life, and numerous IoT-based scenarios will be seen in future of modern cities ranging from small indoor situations to huge outdoor environments. In this era, navigation continues to be ...

Third-generation neural networks, or Spiking Neural Networks (SNNs), aim at harnessing the energy efficiency of spike-domain processing by building on computing elements that operate on, and exchange, spikes. In this paper, the problem of training a two-...

A grid graph $$G_{\mathrm{g}}$$Gg is a finite vertex-induced subgraph of the two-dimensional integer grid $$G^\infty $$Gź. A rectangular grid graph R(m, n) is a grid graph with horizontal size m and vertical size n. A rectangular grid graph with a ...

There are more important relationships based on users' behavior and the done activities than those of friendship in online social networks. Study of social behavior of users in these networks has many applications. Analyzing online social networks' ...

Despite many algorithms for embedding graphs on unbounded grids, only a few results on embedding graphs on restricted grids have been published. In this paper, we study the problem of embedding paths and cycles on solid grid graphs. We show that a cycle ...

One of the common methods used in recommender systems is collaborative filtering methods. In these methods, same-interest users' preferences are often recommended to each other based on examining their past interests. On the other hand, one of the ...

Although much research has been devoted to unbiased sampling of various networks, bias is not always disadvantageous, but sometimes useful. Especially for many real-world applications such as detecting influential nodes, spam users, and the most ...

Given two point sets S and T, in a many-to-many matching between S and T each point in S is assigned to one or more points in T and vice versa. A generalization of the many-to-many matching problem is the limited capacity many-to-many matching problem, ...

By means of Wolfe conditions strategy, we propose a quasi-Newton trust-region method to solve box constrained optimization problems. This method is an adequate combination of the compact limited memory BFGS and the trust-region direction while the ...

Although, the Hamiltonicity of solid grid graphs are polynomial-time decidable, the complexity of the longest cycle problem in these graphs is still open. In this paper, by presenting a linear-time constant-factor approximation algorithm, we show that ...

The longest path problem is a well-known NP-hard problem which can be used to model and solve some optimization problems. There are only a few classes of graphs for which this problem can be solved polynomially. In addition, the results show that the ...

Energy detection has been for long constituting the most popular sensing method in RADAR and cognitive radio systems. The present paper investigates the sensing behaviour of an energy detector over Hoyt fading channels, which have been extensively shown ...

Grid graphs are subgraphs of the infinite 2-dimensional integer grid. The Hamiltonian path problem for general grid graphs is a well-known NP-complete problem. In this paper, we present necessary and sufficient conditions for the existence of a ...

A fast and reliable detection scheme is essential in several wireless applications such as radar and cognitive radio systems. Energy detection is such a method as it does not require a priori information of the received signal while it exhibits low ...

The max-flow problem (MFP) is one of the most explored problems in the area of combinatorial optimization and it has a wide variety of potential applications in computer networks, especially in Wireless Sensor Networks (WSNs). In this paper, we propose ...