Sciweavers

2698 search results - page 207 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
15 years 4 months ago
Improved Orientations of Physical Networks
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
Iftah Gamzu, Danny Segev, Roded Sharan
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 11 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
ICPR
2004
IEEE
16 years 7 months ago
Data Dependent Classifier Fusion for Construction of Stable Effective Algorithms
A measure of stability for a wide class of pattern recognition algorithms is introduced to cope with overfitting in classification problems. Based on this concept, constructive me...
Dmitry Kropotov, Dmitry Vetrov
WABI
2007
Springer
16 years 19 days ago
A Graph Clustering Approach to Weak Motif Recognition
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
Christina Boucher, Daniel G. Brown, Paul Church
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
15 years 10 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi