Sciweavers

1529 search results - page 78 / 306
» A slant removal algorithm
Sort
View
IPCO
2010
184views Optimization» more  IPCO 2010»
14 years 3 days ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
ESANN
2006
14 years 1 days ago
Using sampling methods to improve binding site predictions
Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. In previous work we combine random selection under-sampling with th...
Yi Sun, Mark Robinson, Rod Adams, Rene te Boekhors...
BMCBI
2010
134views more  BMCBI 2010»
13 years 10 months ago
BayesMotif: de novo protein sorting motif discovery from impure datasets
Background: Protein sorting is the process that newly synthesized proteins are transported to their target locations within or outside of the cell. This process is precisely regul...
Jianjun Hu, Fan Zhang
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 5 months ago
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
Dániel Marx, Igor Razgon
LPAR
2005
Springer
14 years 4 months ago
Concepts of Automata Construction from LTL
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...
Carsten Fritz