Publications

Export 7151 results:
Author Title [ Type(Desc)] Year
Journal Articles
Reggia JA, Ruppin E, Berndt RS.  1997.  Computer models: A new approach to the investigation of disease. MD Computing. 14:160-168.
Shneiderman B.  1971.  Computer science education and social relevance. ACM SIGCSE Bulletin. 3(1):21-24.
Reggia JA, Tabb DR, Price TR, Banko M, Hebel R.  1984.  Computer-aided assessment of transient ischemic attacks. A clinical evaluation.. Archives of neurology. 41(12):1248-1248.
Reggia JA.  1981.  Computer-assisted medical decision making: a critical review. Annals of biomedical engineering. 9(5):605-619.
Lee C, Varshney A.  2006.  Computing and displaying intermolecular negative volume for docking. Scientific visualization: the visual extraction of knowledge from data. I:49-64.
De Floriani L, Panozzo D, Hui A.  2009.  Computing and visualizing a graph-based decomposition for non-manifold shapes. Graph-Based Representations in Pattern Recognition. :62-71.
Cleaveland R, Steffen B.  1991.  Computing behavioural relations, logically. Automata, Languages and Programming. :127-138.
Li J, Deshpande A, Khuller S.  2009.  On Computing Compression Trees for Data Collection in Sensor Networks. arXiv:0907.5442.
Khuller S.  1989.  On computing graph closures. Information Processing Letters. 31(5):249-255.
Bröcheler M, Getoor L.  2010.  Computing marginal distributions over continuous markov networks for statistical relational learning. Advances in Neural Information Processing Systems (NIPS).
Vitali M, De Floriani L, Magillo P.  2011.  Computing morse decompositions for triangulated terrains: an analysis and an experimental evaluation. Image Analysis and Processing–ICIAP 2011. :565-574.
Khuller S, Martinez M, Nau DS, Sliva A, Simari G, Subrahmanian V.  2007.  Computing most probable worlds of action probabilistic logic programs: scalable estimation for 10^30,000 worlds. Annals of Mathematics and Artificial Intelligence. 51(2):295-331.
Fernández1 J A, Minker J, Yahya A.  2007.  COMPUTING PERFECT AND STABLE MODELS USING ORDERED MODEL TREES. Computational Intelligence. 11(1):89-112.
Minker J, Perlis D.  1985.  Computing protected circumscription. The Journal of Logic Programming. 2(4):235-249.
Varshney A, Brooks, F.P. J., Wright WV.  1994.  Computing smooth molecular surfaces. Computer Graphics and Applications, IEEE. 14(5):19-25.
Ruiz C, Minker J.  1995.  Computing stable and partial stable models of extended disjunctive logic programs. Non-Monotonic Extensions of Logic Programming. :205-229.
O'Leary DP, Stewart G.W.  1990.  Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices. Journal of Computational Physics. 90(2):497-505.
Srinivasan A.  2010.  Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009. SIGACT News. 41(1):28-30.
Sidhu T, Klavans J, Jimmy Lin.  2007.  Concept disambiguation for improved subject access using multiple knowledge sources. Proceedings of the Workshop on Language Technology for Cultural Heritage Data (LaTeCH 2007). :25-25.
Dorr BJ, Voss C, Peterson E, Kiker M.  1994.  Concept-based lexical selection. Proceedings of the AAAI-94 Fall Symposium on Knowledge Representation for Natural Language Processing in Implemented Systems.
Roussopoulos N, Karagiannis D.  2009.  Conceptual modeling: past, present and the continuum of the future. Conceptual Modeling: Foundations and Applications. :139-152.
Castro-Nallar E, Hasan NA, Cebula TA, Colwell RR, Robison RA, W. Johnson E, Crandall KA.  2015.  Concordance and discordance of sequence survey methods for molecular epidemiology. PeerJ. (8105394):e761.
Cleaveland R, Parrow J, Steffen B.  1993.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems. 15:36-72.
Gupta SK, Nau DS, Zhang G.  1993.  Concurrent evaluation of machinability during product design. Computer. 26(1):61-63.
Hazay C, Katz J, Koo CY, Lindell Y.  2007.  Concurrently-secure blind signatures without random oracles or setup assumptions. Theory of Cryptography. :323-341.

Pages