Sciweavers

4486 search results - page 647 / 898
» Adaptable Boundary Sets
Sort
View
WSC
2007
15 years 9 months ago
New greedy myopic and existing asymptotic sequential selection procedures: preliminary empirical results
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
Stephen E. Chick, Jürgen Branke, Christian Sc...
BMCBI
2010
135views more  BMCBI 2010»
15 years 6 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
BMCBI
2006
124views more  BMCBI 2006»
15 years 6 months ago
Detection of divergent genes in microbial aCGH experiments
Background: Array-based comparative genome hybridization (aCGH) is a tool for rapid comparison of genomes from different bacterial strains. The purpose of such analysis is to dete...
Lars Snipen, Dirk Repsilber, Ludvig Nyquist, &Arin...
CSCW
2006
ACM
15 years 6 months ago
Loose Coupling and Healthcare Organizations: Deployment Strategies for Groupware
Healthcare organizations are often organized in a modular, loosely coupled fashion where separate and semi-autonomous work units specialize in different areas of care delivery. Thi...
David Pinelle, Carl Gutwin
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
15 years 6 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy