Sciweavers

7129 search results - page 870 / 1426
» Approximation Algorithms for Treewidth
Sort
View
BMCBI
2008
121views more  BMCBI 2008»
15 years 5 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
143
Voted
DISOPT
2008
107views more  DISOPT 2008»
15 years 5 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin
131
Voted
DKE
2008
72views more  DKE 2008»
15 years 5 months ago
On space constrained set selection problems
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
Themis Palpanas, Nick Koudas, Alberto O. Mendelzon
CSDA
2006
116views more  CSDA 2006»
15 years 5 months ago
Bayesian multiscale analysis for time series data
A recently proposed Bayesian multiscale tool for exploratory analysis of time series data is reconsidered and umerous important improvements are suggested. The improvements are in...
Tor Arne Øigård, Håvard Rue, Fr...
DM
2006
91views more  DM 2006»
15 years 5 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber