Sciweavers

3172 search results - page 514 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
BMCBI
2005
94views more  BMCBI 2005»
15 years 6 months ago
Workflows in bioinformatics: meta-analysis and prototype implementation of a workflow generator
Background: Computational methods for problem solving need to interleave information access and algorithm execution in a problem-specific workflow. The structures of these workflo...
Alexander García Castro, Samuel Thoraval, L...
JASIS
2007
101views more  JASIS 2007»
15 years 6 months ago
Mining Web functional dependencies for flexible information access
We present an approach to enhancing information access through web structure mining in contrast to traditional approaches involving usage mining. Specifically, we mine the hardwi...
Saverio Perugini, Naren Ramakrishnan
TSP
2008
151views more  TSP 2008»
15 years 6 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
JUCS
2007
108views more  JUCS 2007»
15 years 6 months ago
On Pipelining Sequences of Data-Dependent Loops
: Sequences of data-dependent tasks, each one traversing large data sets, exist in many applications (such as video, image and signal processing applications). Those tasks usually ...
Rui Rodrigues, João M. P. Cardoso
LISP
2007
112views more  LISP 2007»
15 years 6 months ago
Axioms for control operators in the CPS hierarchy
A CPS translation is a syntactic translation of programs, which is useful for describing their operational behavior. By iterating the standard callby-value CPS translation, Danvy a...
Yukiyoshi Kameyama