Search Results

In order to overcome the problems of traditional methods such as large time consumption, high missed detection rate and low recall rate of detection results, a mathematical modelling method of abnormal account detection on social media platform based on ...

We consider the problem of correlation clustering on graphs with constraints on both the cluster sizes and the positive and negative weights of edges. Our contributions are twofold: first, we introduce the problem of correlation clustering with bounded ...

Preserving privacy in social networking environment has been studied extensively in recent years. Although more works have adopted un-weighted graphs to model network relationships, weighted graph modeling can provide deeper analysis of the degree of ...

This paper investigates how to segment an image into semantic regions by harnessing an unlabeled image corpus. First, the image segmentation task is recast as a small-size patch grouping problem. Then, we discover two novel patch-pair priors, namely the ...

We study transitivity properties of edge weights in complex networks. We show that enforcing transitivity leads to a transitivity inequality which is equivalent to ultra-metric inequality. This can be used to define transitive closure on weighted ...

A partition of the edges of a graph G into sets {S₁,..., S_k} defines a multiset X_v for each vertex v where the multiplicity of i in X_v is the number of edges incident to v in S_i We show that the edges of every graph can be partitioned into 4 sets such ...

This paper presents a new approach to fault detection of interconnects; the novelty of the proposed approach is that test generation and scheduling are established using the physical characteristics of the layout of the interconnect under test. This ...

We identify a new problem called geometric bipartitioning that is useful in VLSI layout design. Given a floorplan with rectilinear modules, the problem is to partition the floor by a staircase (monotone increasing) channel from one corner of the floor ...

The software crises is defined as the inability to meet the demands for new software systems, due to the slow rate at which systems can be developed. To address the crisis, object-based design and implementation techniques and domain models have been ...

The iterated complete path (ICP) algorithm is a heuristic search procedure for finding the best path through a weighted trellis. ICP is intended for problems in which the cost of computing the edge weights dominates the cost of finding the path given ...

The all-pairs shortest paths problem in weighted graphs is investigated. An algorithm called the hidden paths algorithm, which finds these paths in time O(m*+n n/sup 2/ log n), where m* is the number of edges participating in shortest paths, is ...