Carlo Sansone - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged C++

A Comparison of the Perceptual Benefits of Linear Perspective and Physically-Based Illumination for Display of Dense 3D StreamtubesChris Weigle, David C. Banks. tvcg, 14(6):1723-1730, 2008. [doi]

Preparing for C++0xValentin David. OOPSLA 2008: 769-770 [doi]

Sixth International Conference on Creating, Connecting and Collaborating through Computing (C:::5::: 2008), January 14-16, Poitiers, FranceIEEE Computer Society, 2008.

Characterization of Flexible RF Microcoil Dedicated to Surface MriMarion Woytasik, J.-C. Ginefri, J.-S. Raynaud, M. Poirier-Quinot, Elisabeth Dufour-Gergam, J.-P. Grandchamp, L. Darrasse, P. Robert, J.-P. Gilles, Emile Martincic, O. Girard. corr, abs/0711.3326, 2007. [doi]

Fifth International Conference on Creating, Connecting and Collaborating through Computing (C:::5::: 2007), 24-26 January 2007, Kyoto, JapanIEEE Computer Society, 2007.

Fourth International Conference on Creating, Connecting and Collaborating through Computing (C:::5::: 2006), 26-27 January 2006, Berkeley, California, USAIEEE Computer Society, 2006.

Minimizing hydrogen content in silicon oxynitride by thermal oxidation of silicon-rich silicon nitrideC. K. Wong, H. Wong, M. Chan, C. W. Kok, H. P. Chan. mr, 46(12):2056-2061, 2006. [doi]

Bounds on the Capacity of the Blockwise Noncoherent APSK-AWGN ChannelsDaniel C. Cunha, Jaime Portugheis. corr, abs/cs/0508040, 2005. [doi]

A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled GraphsDonatello Conte, C. Guidobaldi, Carlo Sansone. gbrpr 2003: 130-141 [doi]

A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected GraphsHorst Bunke, Pasquale Foggia, C. Guidobaldi, Carlo Sansone, Mario Vento. gacm 2002: 123-132 [doi]

On Using a Benchmark to Evaluate C++ ExtractorsSusan Elliott Sim, Richard C. Holt, Steve M. Easterbrook. IWPC 2002: 114-126 [doi]

A labeling scheme for young tableaux spanning representations of permutation group S(N)C. R. Sarma, A. V. V. Nampoothiri. jcc, 21(3):185-190, 2000. [doi]

ACDC: An Algorithm for Comprehension-Driven ClusteringVassilios Tzerpos, Richard C. Holt. WCRE 2000: 258-267 [doi]

On the Stability of Software Clustering AlgorithmsVassilios Tzerpos, Richard C. Holt. IWPC 2000: 211 [doi]

A retina with parallel input and pulsed output, extracting high-resolution informationMichael J. Wilcox, Donald C. Thelen Jr.. tnn, 10(3):574-583, 1999. [doi]

MoJo: A Distance Metric for Software ClusteringsVassilios Tzerpos, Richard C. Holt. WCRE 1999: 187 [doi]

Software Botryology: Automatic Clustering of Software SystemsVassilios Tzerpos, Richard C. Holt. dexaw 1998: 811-818

The Smallest Pair of Noncrossing Paths in a Rectilinear PolygonC. D. Yang, D. T. Lee, C. K. Wong. TC, 46(8):930-941, 1997.

Lorentzian neural netsBertrand G. Giraud, Alan S. Lapedes, Lon Chang Liu, Jörg C. Lemm. NN, 8(5):757-767, 1995. [doi]

C++ Conference1994.

An agenda for research directionsRichard C. Holt, Jacob Slonim. cascon 1992: 81-90 [doi]

A framework for using formal methods in object-oriented software developmentRichard C. Holt, Dennis de Champeaux. oopsm, 3(2):9-10, 1992.

C++ Conference1991.

Analyzing Hard-Real-Time Programs For Guaranteed SchedulabilityAlexander D. Stoyenko, V. Carl Hamacher, Richard C. Holt. TSE, 17(8):737-750, 1991. [doi]

cDNA sequence of the env gene of a pathogenic equine infectious anemia lentivirus variantT. C. McGuire, P. A. Lacy, K. I. O Rourke. nar, 18(1):196, 1990.

C++ Conference1990.

C++ Conference1988.

Device Management in TURING PLUSRichard C. Holt. sigops, 22(1):33-41, 1988.

On Some Distance Problems in Fixed OrientationsPeter Widmayer, Ying-Fung Wu, C. K. Wong. SICOMP, 16(4):728-746, 1987.

Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear ObstaclesYing-Fung Wu, Peter Widmayer, Martine D. F. Schlag, C. K. Wong. TC, 36(3):321-331, 1987.

SRE-A Syntax Recognizing EditorFrank J. Dudinsky, Richard C. Holt, Safwat G. Zaky. SPE, 15(5):489-497, 1985.

An Optimal Algorithm for the Maximum Alignment of TerminalsPeter Widmayer, C. K. Wong. ipl, 20(2):75-82, 1985.

Algorithmic Studies in Mass Storage SystemsC. K. Wong. Computer Science Press, 1983.

Ranking and Unranking of B-TreesU. I. Gupta, D. T. Lee, C. K. Wong. jal, 4(1):51-60, 1983.

Optimal Wiring of Movable TerminalsInder S. Gopal, Don Coppersmith, C. K. Wong. TC, 32(9):845-858, 1983.

TUNIS: A UNIX Look-Alike Written in Concurrent Euclid (Abstract)Richard C. Holt. sigops, 16(1):4-5, 1982.

A Model for Implementing Euclid Modules and PrototypesRichard C. Holt, David B. Wortman. TOPLAS, 4(4):552-562, 1982. [doi]

A Short Introduction to Concurrent EuclidRichard C. Holt. SIGPLAN, 17(5):60-79, 1982.

Record Allocation for Minimizing Seek DelayU. I. Gupta, D. T. Lee, Joseph Y.-T. Leung, J. W. Pruitt, C. K. Wong. TCS, 16:307-319, 1981.

Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage SystemsC. K. Wong. ACM Comput. Surv., 12(2):167-178, 1980.

A model for implementing Euclid modules and type templatesRichard C. Holt, David B. Wortman. sigplan 1979: 8-12 [doi]

Announcing Concurrent SP/kRichard C. Holt, G. Scott Graham, Edward D. Lazowska, M. A. Scott. sigops, 12(2):4-7, 1978.

A Polynomial-Time Algorithm for the Knapsack Problem with Two VariablesDaniel S. Hirschberg, C. K. Wong. JACM, 23(1):147-154, 1976. [doi]

A Note on the Set Basis Problem Related to the Compaction of Character SetsLawrence T. Kou, C. K. Wong. CACM, 18(11):656-557, 1975.

A Combinatorial Problem Related to Multimodule Memory OrganizationsC. K. Wong, Don Coppersmith. JACM, 21(3):392-402, 1974. [doi]

On the Optimality of the Probability Ranking Scheme in Storage ApplicationsP. C. Yue, C. K. Wong. JACM, 20(4):624-633, 1973. [doi]

Some Deadlock Properties of Computer SystemsRichard C. Holt. ACM Comput. Surv., 4(3):179-196, 1972.

Some Deadlock Properties of Computer SystemsRichard C. Holt. sosp 1971: 64-71

Comments on Prevention of System DeadlocksRichard C. Holt. CACM, 14(1):36-38, 1971.

runs on WebDSL