1941 search results - page 278 / 389 » On the Hardness of Approximate Reasoning |
193
click to vote
INFOCOM
2005
IEEE
16 years 17 days 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...
168
Voted
SMI
2005
IEEE
16 years 17 days 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, ...
157
Voted
WECWIS
2005
IEEE
16 years 17 days 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...
199
Voted
ASP
2005
Springer
16 years 16 days 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...
205
click to vote
ICML
2004
IEEE
16 years 12 days 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...