Sciweavers

7289 search results - page 257 / 1458
» A Dependent Set Theory
Sort
View
AIL
2008
103views more  AIL 2008»
15 years 6 months ago
A dialogical theory of presumption
The notions of burden of proof and presumption are central to law, but as noted in McCormick on Evidence, they are also the slipperiest of any of the family of legal terms employe...
Douglas Walton
WWW
2009
ACM
16 years 7 months ago
How opinions are received by online communities: a case study on amazon.com helpfulness votes
There are many on-line settings in which users publicly express opinions. A number of these offer mechanisms for other users to evaluate these opinions; a canonical example is Ama...
Cristian Danescu-Niculescu-Mizil, Gueorgi Kossinet...
ICFP
2006
ACM
16 years 6 months ago
Type-theoretic design patterns
The development of design patterns in object-oriented programming aims at capturing good software design in a re-usable generic form. However, design patterns are not expressible ...
Ondrej Rypacek, Roland Carl Backhouse, Henrik Nils...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
16 years 25 days ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 11 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman