Sciweavers

1677 search results - page 91 / 336
» On the Completeness of Quantum Computation Models
Sort
View
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
15 years 6 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
BMCBI
2008
80views more  BMCBI 2008»
15 years 1 months ago
Computational evaluation of TIS annotation for prokaryotic genomes
Background: Accurate annotation of translation initiation sites (TISs) is essential for understanding the translation initiation mechanism. However, the reliability of TIS annotat...
Gang-Qing Hu, Xiaobin Zheng, Li-Ning Ju, Huaiqiu Z...
BMCBI
2005
246views more  BMCBI 2005»
15 years 1 months ago
ParPEST: a pipeline for EST data analysis based on parallel computing
Background: Expressed Sequence Tags (ESTs) are short and error-prone DNA sequences generated from the 5' and 3' ends of randomly selected cDNA clones. They provide an im...
Nunzio D'Agostino, Mario Aversano, Maria Luisa Chi...
ATAL
2011
Springer
14 years 1 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...
CSR
2008
Springer
15 years 3 months ago
From Invariants to Canonization in Parallel
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
Johannes Köbler, Oleg Verbitsky