Sciweavers

22168 search results - page 4330 / 4434
» Computation in Gene Networks
Sort
View
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
15 years 1 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
ALMOB
2006
138views more  ALMOB 2006»
15 years 1 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
IANDC
2006
121views more  IANDC 2006»
15 years 1 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
INTERNET
2008
150views more  INTERNET 2008»
15 years 1 months ago
Convenience Over Correctness
ion. First described in RFC 707,1 with implementation approaches and details later provided by Andrew Birrell and Bruce Nelson,2 RPC has influenced distributed systems research and...
Steve Vinoski
JCSS
2008
81views more  JCSS 2008»
15 years 1 months ago
A simulator for adaptive parallel applications
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
« Prev « First page 4330 / 4434 Last » Next »