Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Paul G. Comba

dblp:72/6475 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1986
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 77% Database system architecture and tuning · 23%
Theoretical computer science
1 paper
Computational geometry · 100%
Computer graphics and multimedia
1 paper
Rendering · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Database system architecture and tuning
database administration
0.011975
Needed: Distributed Control · VLDB 1975
Rendering › hidden surface removal
hidden-line removal
0.011968
A Procedure for Detecting Intersections of Three-Dimensional Objects · J. ACM 1968
Computational geometry › geometric intersection › intersection detection
convex object intersection
0.011968
A Procedure for Detecting Intersections of Three-Dimensional Objects · J. ACM 1968
Computational geometry › geometric intersection
intersection detection
0.011968
A Procedure for Detecting Intersections of Three-Dimensional Objects · J. ACM 1968
Computational geometry
geometric modeling and processing
0.011968
A Procedure for Detecting Intersections of Three-Dimensional Objects · J. ACM 1968

Methods — techniques the papers use, named apart from their topics

pseudocharacteristic function · 0.0
YearPublicationVenuePosition
1986 Approaches to cryptographic key management
abstract
The first titIe of my talk, as it appeared in the tentative program, was "Encryption Work at IBM." Then the second title, as it appeared in the program, was "Data Encryption."The third title appeared in the final program and was "Cryptographic Key Management."The title of the talk I will give to you today is "Approaches to Cryptographic Key Management."When you speak later in the day, you always wonder if it is an advantage or whether people are tired and bored.In my case, I'm happy it's late because so many things have been alluded to and encryption was mentioned in several talks.So I don't have to explain what the DES is and what the NSA is up to.As someone mentioned, the NSA is trying to convince various users to use algorithms that are not fully known or evaluable by users, and there is some controversy on that point.I will not discuss this issue further.Instead, the environment I am addressing myself to is one where many modern crypto-techniques operate, where the algorithm is known but the key is kept secret.I'm going to deal with three approaches to key management.Personal Key Management, where the person decides what the key is.Centralized Key Management, where the ten tral organization decides and distributes the keys.And finally, what is most interesting in the field today, a system which incorporates private keys and __-______-__
Paul G. Comba
PCS1
1986 Panel discussion (panel session)
Stanley A. Kurzban, James A. Schweitzer, Don Holden, Paul G. Comba, George Hertzberg, Bill Miller
PCS4
1975 Needed: Distributed Control
abstract
Nearly all very large data bases of the future will be built by large organizations, and will be very complex and diverse. This paper discusses two approaches to VLDB management: centralized control, where a powerful DB administrator makes all the important decisions about the contents, representation, and access authorization; and distributed control, where the authority to make those decisions is shared between an administration oriented central office and many action oriented users. It is claimed that in large complex enterprises, whether private or public, the organizational and social aspects of DB usage outweigh the technological ones. Arguments are presented to support the thesis that, in such environments, only a regime of distributed control can meet the users' needs and provide the required adaptability, perspicuity and responsiveness. A concept of a decentralized DB is then briefly outlined. An example is presented early on to stress the scope of the problem discussed, and is used later to illustrate specific points.
Paul G. Comba
VLDB1
1968 A Procedure for Detecting Intersections of Three-Dimensional Objects
abstract
As a step toward the solution of the placement problem in engineering design, a procedure has been developed for detecting intersections of convex regions in 3-space by means of a pseudocharacteristic function. The mathematical techniques underlying the procedure are discussed, and a system of programs embodying these techniques is described. As a special case a solution is given for the hidden-line problem in graphic display.
Paul G. Comba
J. ACM1