Sciweavers

15073 search results - page 373 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 9 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
ISMVL
2007
IEEE
112views Hardware» more  ISMVL 2007»
15 years 11 months ago
Survey of Stochastic Computation on Factor Graphs
Stochastic computation is a new alternative approach for iterative computation on factor graphs. In this approach, the information is represented by the statistics of the bit stre...
Saeed Sharifi Tehrani, Shie Mannor, Warren J. Gros...
COMPGEOM
2000
ACM
15 years 9 months ago
Computing approximate shortest paths on convex polytopes
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
DAC
1998
ACM
15 years 9 months ago
Adjoint Transient Sensitivity Computation in Piecewise Linear Simulation
This paper presents a general method for computing transient sensitivities using the adjoint method in event driven simulation algorithms that employ piecewise linear device model...
Tuyen V. Nguyen, Anirudh Devgan, Ognen J. Nastov
EUROPAR
2006
Springer
15 years 8 months ago
On-Line Adaptive Parallel Prefix Computation
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
Jean-Louis Roch, Daouda Traoré, Julien Bern...