Sciweavers

1210 search results - page 221 / 242
» Specifying Precise Use Cases with Use Case Charts
Sort
View
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
13 years 9 months ago
Faster approximation algorithms for the minimum latency problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, David P. Williamson
BMCBI
2010
113views more  BMCBI 2010»
13 years 7 months ago
Gene prioritization and clustering by multi-view text mining
Background: Text mining has become a useful tool for biologists trying to understand the genetics of diseases. In particular, it can help identify the most interesting candidate g...
Shi Yu, Léon-Charles Tranchevent, Bart De M...
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 7 months ago
Symmetric Allocations for Distributed Storage
We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of s...
Derek Leong, Alexandros G. Dimakis, Tracey Ho
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
Mario Bravetti
BMCBI
2006
153views more  BMCBI 2006»
13 years 7 months ago
The 3of5 web application for complex and comprehensive pattern matching in protein sequences
Background: The identification of patterns in biological sequences is a key challenge in genome analysis and in proteomics. Frequently such patterns are complex and highly variabl...
Markus Seiler, Alexander Mehrle, Annemarie Poustka...