Sciweavers

849 search results - page 36 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
APPML
2007
92views more  APPML 2007»
13 years 8 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
RECOMB
1997
Springer
13 years 12 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
ATMOS
2010
183views Optimization» more  ATMOS 2010»
13 years 6 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
ICASSP
2011
IEEE
12 years 11 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
STOC
2002
ACM
91views Algorithms» more  STOC 2002»
14 years 8 months ago
New results on monotone dualization and generating hypergraph transversals
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
Thomas Eiter, Georg Gottlob, Kazuhisa Makino