Results 1  10
of
564,522
On the Maximum Span of FixedAngle Chains
"... Soss proved that it is NPhard to find the maximum flat span of a fixedangle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These fixedangle chains can serve as models of protein backbones. The corresponding problem in 3D is open. We show that two spe ..."
Abstract
 Add to MetaCart
Soss proved that it is NPhard to find the maximum flat span of a fixedangle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These fixedangle chains can serve as models of protein backbones. The corresponding problem in 3D is open. We show that two
On the Maximum Span of FixedAngle Chains
"... Soss proved that it is NPhard to find the maximum flat span of a fixedangle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These fixedangle chains can serve as models of protein backbones. The corresponding problem in 3D is open. We show that two spe ..."
Abstract
 Add to MetaCart
Soss proved that it is NPhard to find the maximum flat span of a fixedangle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These fixedangle chains can serve as models of protein backbones. The corresponding problem in 3D is open. We show that two
On the Maximum Span of FixedAngle Chains
, 2008
"... Soss proved that it is NPhard to find the maximum 2D span of a fixedangle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These fixedangle chains can serve as models of protein backbones. The corresponding problem in 3D is open. We show that three spe ..."
Abstract
 Add to MetaCart
Soss proved that it is NPhard to find the maximum 2D span of a fixedangle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These fixedangle chains can serve as models of protein backbones. The corresponding problem in 3D is open. We show that three
Clustering Web Search Results with Maximum Spanning Trees
"... Abstract. We present a novel method for clustering Web search results based on Word Sense Induction. First, we acquire the meanings of a query by means of a graphbased clustering algorithm that calculates the maximum spanning tree of the cooccurrence graph of the query. Then we cluster the search ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. We present a novel method for clustering Web search results based on Word Sense Induction. First, we acquire the meanings of a query by means of a graphbased clustering algorithm that calculates the maximum spanning tree of the cooccurrence graph of the query. Then we cluster the search
Downsampling of Signals on Graphs Via Maximum Spanning Trees
"... Abstract—Downsampling of signals living on a general weighted graph is not as trivial as of regular signals where we can simply keep every other samples. In this paper we propose a simple, yet effective downsampling scheme in which the underlying graph is approximated by a maximum spanning tree (MST ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—Downsampling of signals living on a general weighted graph is not as trivial as of regular signals where we can simply keep every other samples. In this paper we propose a simple, yet effective downsampling scheme in which the underlying graph is approximated by a maximum spanning tree
Approximating Bounded Degree Maximum Spanning Subgraphs ∗
"... Abstract The bounded degree maximum spanning subgraph problem arising from wireless mesh networks is studied here. Given a connected graph G and a positive integer d ≥ 2, the problem aims to find a maximum spanning subgraph H of G with the constraint: for every vertex v of G, the degree of v in H, d ..."
Abstract
 Add to MetaCart
Abstract The bounded degree maximum spanning subgraph problem arising from wireless mesh networks is studied here. Given a connected graph G and a positive integer d ≥ 2, the problem aims to find a maximum spanning subgraph H of G with the constraint: for every vertex v of G, the degree of v in H
On The Minimum and Maximum Spans of Subgraphs of the Corona of Cycles
"... ABSTRACT. Given a (p,q) graph G, a labeling is a bijective mapping f: V(G) → {0,1,…,p1}. For any labeling f, there is an induced edge labeling f*:E(G) → N, which is defined by f*(xy) = f(x) f(y), for each edge xy ∈ E(G). For each labeling f, we denote the span of f as sp(f) = sum of f*(E(G)) ..."
Abstract
 Add to MetaCart
*(E(G)) i.e. it is the sum of the induced edge labels. We denote sp(G)={sp(f): f is a labeling of V(G)}. We investigate the minimum and maximum spans of some subgraphs of the corona of a cycle.
On maximum spanning DAG algorithms for semantic DAG parsing
"... Consideration of the decoding problem in semantic parsing as finding a maximum spanning DAG of a weighted directed graph carries many complexities that haven’t been fully addressed in the literature to date, among which are its actual appropriateness for the decoding task in semantic parsing, no ..."
Abstract
 Add to MetaCart
Consideration of the decoding problem in semantic parsing as finding a maximum spanning DAG of a weighted directed graph carries many complexities that haven’t been fully addressed in the literature to date, among which are its actual appropriateness for the decoding task in semantic parsing
Maximum spanning tree algorithm for nonprojective labeled dependency parsing
, 2006
"... Following (McDonald et al., 2005), we present an application of a maximum spanning tree algorithm for a directed graph to nonprojective labeled dependency parsing. Using a variant of the voted perceptron (Collins, 2002; Collins and Roark, 2004; Crammer and Singer, 2003), we discriminatively trained ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Following (McDonald et al., 2005), we present an application of a maximum spanning tree algorithm for a directed graph to nonprojective labeled dependency parsing. Using a variant of the voted perceptron (Collins, 2002; Collins and Roark, 2004; Crammer and Singer, 2003), we discriminatively
Indexing Uncoded Stripe Patterns in Structured Light Systems by Maximum Spanning Trees
"... Structured light is a wellknown technique for capturing 3D surface measurements but has yet to achieve satisfactory results for applications demanding high resolution models at frame rate. For these requirements a dense set of uniform uncoded white stripes seems attractive. But the problem of relat ..."
Abstract

Cited by 12 (9 self)
 Add to MetaCart
of relating projected and recorded stripes, here called the Indexing Problem, has proved to be difficult to overcome reliably for uncoded patterns. We propose a new algorithm that uses the maximum spanning tree of a graph defining potential connectivity and adjacency in recorded stripes. Results
Results 1  10
of
564,522