Related papers: A search method for thin positions of links
In this paper we investigate the discrete version of the classical hanging chain problem. We generalize the problem, by allowing for arbitrary mass and length of each link. We show that the shape of the chain can be obtained by solving a…
In this paper, we shall study existence of weak solutions to complex Hessian equations. With appropriate assumptions, it is possible to obtain weak solutions in pluripotential sense.
A widely used strategy to discover and understand language model mechanisms is circuit analysis. A circuit is a minimal subgraph of a model's computation graph that executes a specific task. We identify a gap in existing circuit discovery…
We consider the following distributed pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown $n$-node network. Their goal is to execute a search strategy that guarantees capturing a fast…
We apply an old method for constructing points-and-lines configurations in the plane to study some recent questions in incidence geometry.
Due to the rapid development of World Wide Web (WWW) and imaging technology, more and more images are available in the Internet and stored in databases. Searching the related images by the querying image is becoming tedious and difficult.…
Evaluation of link prediction methods is a hard task in very large complex networks because of the inhibitive computational cost. By setting a lower bound of the number of common neighbors (CN), we propose a new framework to efficiently and…
We suggest a new approach to search for galactic axions or other similar exotica. Streaming dark matter (DM) could have a better discovery potential because of flux enhancement, due to gravitational lensing when the Sun and/or a planet are…
Information on any given topic is often scattered across the web. Previously this scatter has been characterized through the distribution of a set of facts (i.e. pieces of information) across web pages, showing that typically a few pages…
We consider the problem of searching for an object on a line at an unknown distance OPT from the original position of the searcher, in the presence of a cost of d for each time the searcher changes direction. This is a generalization of the…
For discovering the new URI of a missing web page, lexical signatures, which consist of a small number of words chosen to represent the "aboutness" of a page, have been previously proposed. However, prior methods relied on computing the…
Within network analysis, the analytical maximum entropy framework has been very successful for different tasks as network reconstruction and filtering. In a recent paper, the same framework was used for link-prediction for monopartite…
Recently, Yeh [Yeh, WC. (2006). A simple algorithm to search for all MCs in networks. European Journal of Operational Research, 174, 1694{1705.] has proposed a simple algorithm to find all the Minimal Cuts in an undirected graph. However,…
We introduce Loop Ranking, a new ranking measure based on the detection of closed paths, which can be computed in an efficient way. We analyze it with respect to several ranking measures which have been proposed in the past, and are widely…
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path.…
A common technique to speed up shortest path queries in graphs is to use a bidirectional search, i.e., performing a forward search from the start and a backward search from the destination until a common vertex on a shortest path is found.…
We introduce a new method to search for the dark matter sector particles using laser light. Some dark matter particles may have a small mixing or interaction with a photon. High-power lasers provide substantial test grounds for these…
We formulate and study the thinnest path problem in wireless ad hoc networks. The objective is to find a path from a source to its destination that results in the minimum number of nodes overhearing the message by a judicious choice of…
We construct an algorithm to decide whether two given Legendrian or transverse links are equivalent. In general, the complexity of the algorithm is too high for practical implementation. However, in many cases, when the symmetry group of…
A virtual link can be understood as a link in a trivial I-bundle over an orientable compact surface with genus. A twisted virtual link is a link in a trivial I-bundle over a not-necessarily orientable compact surface. A twisted virtual…