Sciweavers

15073 search results - page 58 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
CLUSTER
2008
IEEE
15 years 4 months ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman
JOC
2007
125views more  JOC 2007»
14 years 9 months ago
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
Jean-Sébastien Coron, Alexander May
BMCBI
2004
88views more  BMCBI 2004»
14 years 9 months ago
PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences
Background: This paper addresses the problem of discovering transcription factor binding sites in heterogeneous sequence data, which includes regulatory sequences of one or more g...
Saurabh Sinha, Mathieu Blanchette, Martin Tompa
TSMC
2002
134views more  TSMC 2002»
14 years 9 months ago
Incorporating soft computing techniques into a probabilistic intrusion detection system
There are a lot of industrial applications that can be solved competitively by hard computing, while still requiring the tolerance for imprecision and uncertainty that can be explo...
Sung-Bae Cho
JMLR
2010
111views more  JMLR 2010»
14 years 4 months ago
An EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato,...