Sciweavers

849 search results - page 19 / 170
» Completely Non-malleable Schemes
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
CSREAESA
2004
13 years 9 months ago
A Distributed FIFO Scheme for System on Chip Inter-Component Communication
Interconnect delays are increasingly becoming the dominant source of performance degradation in the nano-meter regime, largely because the wires do not scale as fast as the device...
Ray Robert Rydberg III, Jabulani Nyathi, Jos&eacut...
BMCBI
2008
190views more  BMCBI 2008»
13 years 7 months ago
Which missing value imputation method to use in expression profiles: a comparative study and two selection schemes
Background: Gene expression data frequently contain missing values, however, most downstream analyses for microarray experiments require complete data. In the literature many meth...
Guy N. Brock, John R. Shaffer, Richard E. Blakesle...
ICWS
2009
IEEE
13 years 5 months ago
A Dynamic Approach toward QoS-Aware Service Workflow Composition
Web service-based workflow management systems have garnered considerable attention for automating and scheduling dependent operations. Such systems often support user preferences,...
David Chiu, Sagar Deshpande, Gagan Agrawal, Rongxi...
LICS
2008
IEEE
14 years 2 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...