Sciweavers

3890 search results - page 320 / 778
» Computation of unirational fields
Sort
View
ECCC
2010
86views more  ECCC 2010»
15 years 7 months ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...
CLEIEJ
2006
97views more  CLEIEJ 2006»
15 years 7 months ago
Prediction of RNA Pseudoknotted Secondary Structure using Stochastic Context Free Grammars (SCFG)
Pseudoknots are a frequent RNA structure that assumes essential roles for varied biocatalyst cell's functions. One of the most challenging fields in bioinformatics is the pre...
Rafael Garcia
APAL
2005
117views more  APAL 2005»
15 years 7 months ago
About cut elimination for logics of common knowledge
The notions of common knowledge or common belief play an important role in several areas of computer science (e.g. distributed systems, communication), in philosophy, game theory,...
Luca Alberucci, Gerhard Jäger
161
Voted
CPHYSICS
2004
80views more  CPHYSICS 2004»
15 years 7 months ago
A treecode algorithm for simulating electron dynamics in a Penning-Malmberg trap
A treecode algorithm is presented for computing the electrostatic potential and electric field in a system of charged particles. The algorithm is grid-free and with N particles it...
A. J. Christlieb, R. Krasny, John P. Verboncoeur
148
Voted
CAGD
2002
61views more  CAGD 2002»
15 years 7 months ago
Polynomial parametrization of curves without affine singularities
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial param...
Jaime Gutierrez, Rosario Rubio, Josef Schicho