Sciweavers

653 search results - page 107 / 131
» The size of minimum 3-trees
Sort
View
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 1 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
ACID
2006
220views Algorithms» more  ACID 2006»
15 years 1 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
BIOCOMP
2006
15 years 1 months ago
A Multi-strategy Approach to Protein Structural Alphabet Design
- The search for structural similarity among proteins can provide valuable insights into their functional mechanisms and their functional relationships. Though the protein 1D seque...
Shih-Yen Ku, Yuh-Jyh Hu
STRINGOLOGY
2004
15 years 1 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
ESA
2010
Springer
162views Algorithms» more  ESA 2010»
15 years 12 hour ago
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S....