Sciweavers

9842 search results - page 71 / 1969
» Problem complexity
Sort
View
RECOMB
2008
Springer
14 years 10 months ago
A Bayesian Approach to Protein Inference Problem in Shotgun Proteomics
The protein inference problem represents a major challenge in shotgun proteomics. Here we describe a novel Bayesian approach to address this challenge that incorporates the predict...
Yong Fuga Li, Randy J. Arnold, Yixue Li, Predrag R...
IWPEC
2009
Springer
14 years 4 months ago
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
Petr A. Golovach, Dimitrios M. Thilikos
CORR
2006
Springer
122views Education» more  CORR 2006»
13 years 9 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
Frank Neven, Thomas Schwentick
IAT
2009
IEEE
14 years 4 months ago
Autonomous UAV Surveillance in Complex Urban Environments
We address the problem of multi-UAV surveillance in complex urban environments with occlusions. The problem consists of coordinating the flight of UAVs with on-board cameras so t...
Eduard Semsch, Michal Jakob, Dusan Pavlícek...
ANOR
2007
58views more  ANOR 2007»
13 years 9 months ago
A fast swap-based local search procedure for location problems
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
Mauricio G. C. Resende, Renato Fonseca F. Werneck