Sciweavers

953 search results - page 145 / 191
» A note on the paper
Sort
View
CIKM
2006
Springer
13 years 11 months ago
CP/CV: concept similarity mining without frequency information from domain describing taxonomies
Domain specific ontologies are heavily used in many applications. For instance, these form the bases on which similarity/dissimilarity between keywords are extracted for various k...
Jong Wook Kim, K. Selçuk Candan
FOCS
2009
IEEE
14 years 2 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
KR
2004
Springer
14 years 1 months ago
Historical Remarks on Nonmonotonic Reasoning, Especially Circumscription
Humans have always done nonmonotonic reasoning, but rigorous monotonic reasoning in reaching given conclusions has been deservedly more respected and admired. Euclid contains the ...
John McCarthy
WPES
2003
ACM
14 years 29 days ago
Analysis of privacy preserving random perturbation techniques: further explorations
Privacy is becoming an increasingly important issue in many data mining applications, particularly in the security and defense area. This has triggered the development of many pri...
Haimonti Dutta, Hillol Kargupta, Souptik Datta, Kr...
ISAAC
2003
Springer
91views Algorithms» more  ISAAC 2003»
14 years 28 days ago
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yama...