Results 1  10
of
157,753
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important
A Formal Framework for Linguistic Annotation
 Speech Communication
, 2000
"... `Linguistic annotation' covers any descriptive or analytic notations applied to raw language data. The basic data may be in the form of time functions  audio, video and/or physiological recordings  or it may be textual. The added notations may include transcriptions of all sorts (from pho ..."
Abstract

Cited by 179 (24 self)
 Add to MetaCart
and demonstrate a common conceptual core, the annotation graph. This provides a formal framework for constructing, mai...
Degree Sequences of Random Bipartite Graphs
, 2010
"... This concerns three random bipartite graph models. For each random graph model a binomially based model is explicitly constructed which has the property that for ‘most’ degree sequences (s, t), the probability of (s, t) in the graph model is asymptotically approximated by the probability of (s, t) i ..."
Abstract
 Add to MetaCart
This concerns three random bipartite graph models. For each random graph model a binomially based model is explicitly constructed which has the property that for ‘most’ degree sequences (s, t), the probability of (s, t) in the graph model is asymptotically approximated by the probability of (s, t
Detecting SubTopic Correspondence through Bipartite Term Clustering
 Proceedings of the ACL99 Workshop on Unsupervised Learning in Natural Language Processing
, 1999
"... Ido DAGAN The Institute for Info. Retrieval and Computational Linguistics, The Department of Mathematics and Computer Science, BarIlan University dagan@cs.biu.ac.il related to each other? This paper addresses a novel task of detecting subtopic correspondence in a pair of text fragments, ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
, enhancing common notions of text similarity. This task is addressed by coupling corresponding term subsets through bipartite clustering. The paper presents a costbased clustering scheme and compares it with a bipartite version of the singlelink method, providing illustrating results.
Approximation Algorithms for Bipartite Matching with Metric and Geometric Costs
"... Let G = G(A ∪ B, A×B), with A  = B  = n, be a weighted bipartite graph, and let d(·, ·) be the cost function on the edges. Let w(M) denote the weight of a matching in G, and M ∗ a minimumcost perfect matching in G. We call a perfect matching M capproximate, for c ≥ 1, if w(M) ≤ c · w(M ∗). ..."
Abstract
 Add to MetaCart
Let G = G(A ∪ B, A×B), with A  = B  = n, be a weighted bipartite graph, and let d(·, ·) be the cost function on the edges. Let w(M) denote the weight of a matching in G, and M ∗ a minimumcost perfect matching in G. We call a perfect matching M capproximate, for c ≥ 1, if w(M) ≤ c · w
Finding Maximum Edge Bicliques in Convex Bipartite Graphs?
"... Abstract. A bipartite graph G = (A,B,E) is convex on B if there exists an ordering of the vertices of B such that for any vertex v ∈ A, vertices adjacent to v are consecutive in B. A complete bipartite subgraph of a graph G is called a biclique of G. Motivated by an application to analyzing DNA mic ..."
Abstract
 Add to MetaCart
Abstract. A bipartite graph G = (A,B,E) is convex on B if there exists an ordering of the vertices of B such that for any vertex v ∈ A, vertices adjacent to v are consecutive in B. A complete bipartite subgraph of a graph G is called a biclique of G. Motivated by an application to analyzing DNA
Cluster graph modification problems �
, 2004
"... In a clustering problem one has to partition a set of elements into homogeneous and wellseparated subsets. From a graph theoretic point of view, a cluster graph is a vertexdisjoint union of cliques. The clustering problem is the task of making the fewest changes to the edge set of an input graph s ..."
Abstract
 Add to MetaCart
In a clustering problem one has to partition a set of elements into homogeneous and wellseparated subsets. From a graph theoretic point of view, a cluster graph is a vertexdisjoint union of cliques. The clustering problem is the task of making the fewest changes to the edge set of an input graph
Combining Formal Concept Analysis with Information Retrieval for Concept Location in Source Code
 in Proc. of ICPC'07
, 2007
"... The paper addresses the problem of concept location in source code by presenting an approach which combines Formal Concept Analysis (FCA) and Latent Semantic Indexing (LSI). In the proposed approach, LSI is used to map the concepts expressed in queries written by the programmer to relevant parts of ..."
Abstract

Cited by 70 (18 self)
 Add to MetaCart
The paper addresses the problem of concept location in source code by presenting an approach which combines Formal Concept Analysis (FCA) and Latent Semantic Indexing (LSI). In the proposed approach, LSI is used to map the concepts expressed in queries written by the programmer to relevant parts
Using the bipartite line graph to visualize 2mode social networks
"... This paper surveys the range of techniques available for the analysis of 2mode (actorbyevent) datasets and proposes an additional option for visualization and analysis that uses the linegraph of the bipartite adjacency matrix. The nodes of this linegraph are roles or statuses conferred on actors ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper surveys the range of techniques available for the analysis of 2mode (actorbyevent) datasets and proposes an additional option for visualization and analysis that uses the linegraph of the bipartite adjacency matrix. The nodes of this linegraph are roles or statuses conferred on actors
Evolutionary Optimization and the Estimation of Search Distributions with Applications to Graph Bipartitioning
 Journal of Approximate Reasoning
, 2002
"... We present a theory of population based optimization methods using approximations of search distributions. We prove convergence of the search distribution to the global optima for the Factorized Distribution Algorithm FDA if the search distribution is a Boltzmann distribution and the size of the pop ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
. We discuss the relation of the FDA approach to methods used in statistical physics to approximate a Boltzmann distribution and to belief propagation in probabilistic reasoning. In the last part, we apply the algorithm to an important practical problem, the bipartioning of large graphs. We assume
Results 1  10
of
157,753