Most prior work either requires seeds, one per segment; or a threshold; or formulates the task as an NP-hard signed graph partitioning problem. Here, we propose an algorithm with empirically linearithmic comple
We proceed as in Section 2 by defining the auxiliary graph Gt = (P, Et). We also require the following definition. Let E be a set of line segments in the plane. A line l is a stabbing line for E if I intersects every line segment in E. Figure 3 illustrates the construction of ...
more than two vertices. Thek-way hypergraph partitioning problem is the generalization of the well-knowngraph partitioningproblem: partition the vertex set intokdisjoint blocks of bounded size (at most 1 + ε times the average block size), while minimizing an objective function defined on the ...
The observations of gene expressions are curves mea- sured according to time on each gene. We can then call the observed lines of genes functional data because an observed intensity is recorded at each time point on a line segment. Functional data analysis is possibly consid- ered a suitable...
,vn}, and we define the graph (roadmap) G=(V,E), where (i,j)∈E whenever the segment [vi,vj] belongs to the environment (locations vi and vj are within line of sight). Let the weight of the edge (i,j Camera trajectory for intruder detection We now define a particular cameras ...
In 1991, he developed the first commercial biomedical ontology system organized as a directed acyclic graph, which contained 60,000 concepts (Purkinje.com, 1990). He is actively involved with two major NIH-funded ontology groups: the Systematized...
We experimentally study unsaturated flow through fracture intersections with a focus on the flow-partitioning behavior We identify three regimes of partitioning behavior, including total partitioni...
disturb the topology of skeleton's graph seriously. For example, the skeleton in Fig. 1(a) has many redundant skeleton branches generated by boundary noise. The most common approaches to overcome skeleton's instability are based on skeleton pruning, i.e., eliminating redundant skeleton branches....
By way of example, a computer processor can be configured to execute local partitioning based on evolving set instructions. The instructions can be employed to transition a set of analyzed vertices of a graph until a segment of the graph with small conductance is identified. A transitioning ...
on a comparison between merit function values of the one or more adaptive partitions, each of the one or more adaptive partitions comprising said multiple process threads, where the merit function values for a particular partition, p, of the one or more adaptive partitions is based, at least ...