The paper deals in a preliminary way with the problem of the selection of a unique fuzzy preference relation from the set of fuzzy preference relations. A direct algorithm of possibilistic clustering is the basis of the method of fuzzy preference relation discriminating. A method of decision-making based on a fuzzy preference relation is described and basic concepts of the heuristic method of p...

DNA sequence alignment is one of the most important operations of computational biology. In 1981, Smith and Waterman developed a method for sequences local alignment. Due to its computational power and memory requirements, various heuristics have been developed to reduce execution time at the expense of a loss of accuracy in the result. This is why heuristics do not ensure that the best alignme...

Over the last years, entity detection approaches which combine named entity recognition and entity linking have been used to detect mentions of RDF resources from a given reference knowledge base in unstructured data. In this paper, we address the problem of assigning a single URI to named entities which stand for the same real-object across documents but are not yet available in the reference ...

Animal foraging routes are analogous to the computationally demanding "traveling salesman problem" (TSP), where individuals must find the shortest path among several locations before returning to the start. Humans approximate solutions to TSPs using simple heuristics or "rules of thumb," but our knowledge of how other animals solve multidestination routing problems is incomplete. Most nonhuman ...

The Network Testbed Mapping Problem is the problem of mapping an emulated network into a test cluster such as Emulab or DETER. In this paper, we demonstrate that the Network Testbed Mapping Problem is NP-complete when there is constrained bandwidth between cluster switches. We demonstrate that the problem is trivial when bandwidth is unconstrained, and note that a number of new proposals for da...

This work presents a novel technique to perform audience privacy protection in video lectures. The main contribution of this work is a heuristic based iterative clustering procedure that isolates the lecturer from audience members. This iterative process provides the labelling required to identify and blur audience members.

In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a Directed Acyclic Graph (DAG) to a target machine. As most heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the inter communication links. This article extends the list scheduling heuristic for contention aware sch...

The Cluster-head Gateway Switch Routing protocol (CGSR) uses a hierarchical network topology. CGSR organizes nodes into clusters, with coordination among the members of each cluster entrusted to a special node named cluster-head. The cluster head selection is done with the help of any of the algorithm for cluster head selection. Energy is the primary constraint on designing any Wireless Network...

We present a simple and scalable algorithm for clustering tens of millions of phrases and use the resulting clusters as features in discriminative classifiers. To demonstrate the power and generality of this approach, we apply the method in two very different applications: named entity recognition and query classification. Our results show that phrase clusters offer significant improvements ove...

Rich data provided by tweets have been analyzed, clustered, and explored in a variety of studies. Typically those studies focus on named entity recognition, entity linking, and entity disambiguation or clustering. Tweets and hashtags are generally analyzed on sentential or word level but not on a compositional level of concatenated words. We propose an approach for a closer analysis of compound...