15073 search results - page 70 / 3015 » Probabilistic algorithms for computing resultants |
165
click to vote
PODC
2009
ACM
16 years 3 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
148
click to vote
MIC
2003
15 years 4 months ago
2003
A lumped heat transfer model and parameter estimation technique are proposed for determining key parameters associated with a heat flux Differential Scanning Calorimeter (DSC). T...
124
click to vote
DCG
2010
15 years 3 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
129
click to vote
TCS
2010
15 years 1 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
134
click to vote
ALT
2005
Springer
16 years 4 days ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...