Sciweavers

4926 search results - page 113 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
126
Voted
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
16 years 2 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
RECOMB
2004
Springer
16 years 2 months ago
Maximum likelihood resolution of multi-block genotypes
We present a new algorithm for the problems of genotype phasing and block partitioning. Our algorithm is based on a new stochastic model, and on the novel concept of probabilistic...
Gad Kimmel, Ron Shamir
FOCS
1993
IEEE
15 years 6 months ago
Simulated Annealing for Graph Bisection
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
Mark Jerrum, Gregory B. Sorkin
120
Voted
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 3 months ago
Evolution of discrete gene regulatory models
Gene regulatory networks (GRNs) are complex control systems that govern the interaction of genes, which ultimately control cellular processes at the protein level. GRNs can be ted...
Afshin Esmaeili, Christian Jacob
INFOCOM
2007
IEEE
15 years 8 months ago
Performance Evaluation of Loss Networks via Factor Graphs and the Sum-Product Algorithm
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
Jian Ni, Sekhar Tatikonda