3946 search results - page 546 / 790 » The computational complexity of choice sets |
188
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
191
click to vote
SIGMOD
1994
ACM
15 years 10 months ago
1994
ACM
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
221
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Multicategory Support Vector Machines (MC-SVM) are powerful classification systems with excellent performance in a variety of data classification problems. Since the p...
164
click to vote
JUCS
2007
15 years 6 months ago
2007
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
143
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...