1866 search results - page 300 / 374 » Robust Algorithms and Price of Robustness in Shunting Proble... |
152
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
168
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
215
click to vote
COMPGEOM
2001
ACM
15 years 9 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
150
Voted
MOBICOM
2006
ACM
16 years 3 days ago
2006
ACM
We study the problem of information brokerage in sensor networks, where information consumers (sinks, users) search for data acquired by information producers (sources). Innetwork...
186
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Microarray analysis is an important area of bioinformatics. In the last few years, biclustering has become one of the most popular methods for classifying data from mi...