Sciweavers

484 search results - page 90 / 97
» Computing Hilbert Class Polynomials
Sort
View
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
13 years 11 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
EMSOFT
2009
Springer
13 years 11 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
BMCBI
2004
151views more  BMCBI 2004»
13 years 7 months ago
Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
Jens Reeder, Robert Giegerich
ICCV
2011
IEEE
12 years 7 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson