Results 1  10
of
313,999
Minimum Cuts and Shortest Homologous Cycles
 SYMPOSIUM ON COMPUTATIONAL GEOMETRY
, 2009
"... We describe the first algorithms to compute minimum cuts in surfaceembedded graphs in nearlinear time. Given an undirected graph embedded on an orientable surface of genus g, with two specified vertices s and t, our algorithm computes a minimum (s, t)cut in g O(g) n log n time. Except for the spec ..."
Abstract

Cited by 33 (11 self)
 Add to MetaCart
cost subgraph in every Z2homology class. We also prove that finding a minimumcost subgraph homologous to a single input cycle is NPhard.
Homological Algebra of Mirror Symmetry
 in Proceedings of the International Congress of Mathematicians
, 1994
"... Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual Ca ..."
Abstract

Cited by 529 (3 self)
 Add to MetaCart
Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual CalabiYau manifolds V, W of dimension n (not necessarily equal to 3) one has dim H p (V, Ω q) = dim H n−p (W, Ω q). Physicists conjectured that conformal field theories associated with mirror varieties are equivalent. Mathematically, MS is considered now as a relation between numbers of rational curves on such a manifold and Taylor coefficients of periods of Hodge structures considered as functions on the moduli space of complex structures on a mirror manifold. Recently it has been realized that one can make predictions for numbers of curves of positive genera and also on CalabiYau manifolds of arbitrary dimensions. We will not describe here the complicated history of the subject and will not mention many beautiful contsructions, examples and conjectures motivated
The SWISSMODEL Workspace: A webbased environment for protein structure homology modelling
 BIOINFORMATICS
, 2005
"... Motivation: Homology models of proteins are of great interest for planning and analyzing biological experiments when no experimental threedimensional structures are available. Building homology models requires specialized programs and uptodate sequence and structural databases. Integrating all re ..."
Abstract

Cited by 555 (5 self)
 Add to MetaCart
Motivation: Homology models of proteins are of great interest for planning and analyzing biological experiments when no experimental threedimensional structures are available. Building homology models requires specialized programs and uptodate sequence and structural databases. Integrating all
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
An Adaptive EnergyEfficient MAC Protocol for Wireless Sensor Networks
 SENSYS'03
, 2003
"... In this paper we describe TMAC, a contentionbased Medium Access Control protocol for wireless sensor networks. Applications for these networks have some characteristics (low message rate, insensitivity to latency) that can be exploited to reduce energy consumption by introducing an active/sleep du ..."
Abstract

Cited by 526 (13 self)
 Add to MetaCart
/sleep duty cycle. To handle load variations in time and location TMAC introduces an adaptive duty cycle in a novel way: by dynamically ending the active part of it. This reduces the amount of energy wasted on idle listening, in which nodes wait for potentially incoming messages, while still maintaining a
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
problem, in which all shortestpath computations are performed on networks with all weights nonnegative. In particular, this
Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks
 IEEE/ACM Transactions on Networking
, 2004
"... This paper proposes SMAC, a medium access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use batteryoperated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect senso ..."
Abstract

Cited by 684 (15 self)
 Add to MetaCart
.11 in several ways: energy conservation and selfconfiguration are primary goals, while pernode fairness and latency are less important. SMAC uses a few novel techniques to reduce energy consumption and support selfconfiguration. It enables lowdutycycle operation in a multihop network. Nodes form virtual
AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS
, 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract

Cited by 712 (1 self)
 Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.
Knowledgebased Analysis of Microarray Gene Expression Data By Using Support Vector Machines
, 2000
"... We introduce a method of functionally classifying genes by using gene expression data from DNA microarray hybridization experiments. The method is based on the theory of support vector machines (SVMs). SVMs are considered a supervised computer learning method because they exploit prior knowledge of ..."
Abstract

Cited by 514 (8 self)
 Add to MetaCart
We introduce a method of functionally classifying genes by using gene expression data from DNA microarray hybridization experiments. The method is based on the theory of support vector machines (SVMs). SVMs are considered a supervised computer learning method because they exploit prior knowledge of gene function to identify unknown genes of similar function from expression data. SVMs avoid several problems associated with unsupervised clustering methods, such as hierarchical clustering and selforganizing maps. SVMs have many mathematical features that make them attractive for gene expression analysis, including their exibility in choosing a similarity function, sparseness of solution when dealing with large data sets, the ability t...
Results 1  10
of
313,999