1941 search results - page 278 / 389 » On the Hardness of Approximate Reasoning |
161
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
152
click to vote
SMI
2005
IEEE
15 years 12 months ago
2005
IEEE
The recent ability to measure quickly and inexpensively dense sets of points on physical objects has deeply influenced the way engineers used to represent shapes in CAD systems, ...
148
click to vote
WECWIS
2005
IEEE
15 years 12 months ago
2005
IEEE
We consider truthful online auctions that aim at optimizing sellers’ revenues, representing service contributors’ satisfactions, as a general model for pricing peer-to-peer se...
181
click to vote
ASP
2005
Springer
15 years 11 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
181
click to vote
ICML
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard binary classifiers, RankOpt adopts the AUC stat...