15073 search results - page 240 / 3015 » Probabilistic algorithms for computing resultants |
167
click to vote
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
148
click to vote
EMNLP
2010
15 years 2 months ago
2010
The computation of meaning similarity as operationalized by vector-based models has found widespread use in many tasks ranging from the acquisition of synonyms and paraphrases to ...
113
click to vote
DNA
2005
Springer
15 years 9 months ago
2005
Springer
We introduce a class of generalized DNF formulae called wDNF or weighted disjunctive normal form, and present a molecular algorithm that learns a wDNF formula from training example...
142
click to vote
ECP
1997
Springer
15 years 8 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
271
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...