Pulse Explorar nav.journalClub Debates Tendencias Investigadores Revistas

Join discussions, follow papers, and never miss your next session.

Download on theApp Store

Inicio Explorar nav.journalClub Tendencias

⌘+K

On Finding the Maxima of a Set of Vectors | Synapse

October 1, 1975Open Access

On Finding the Maxima of a Set of Vectors

HKH. T. KungNational Pingtung University of Science and Technology FLFabrizio LuccioUniversity of Pisa FPF. P. PreparataLiceo scientifico statale Ulisse Dini

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

ASSTRACT. Let U1 , U2, . . . , Ud be totally ordered sets and let V be a set of n d-dimensional vectors In U~ X Us. . X Ud . A partial ordering is defined on V in a natural way The problem of finding all maximal elements of V with respect to the partial ordering ~s considered The computational complexity of the problem is defined to be the number of required comparisons of two components and

Preguntar a la IA

Me gusta

Guardar

Compartir

Ver artículo completo

Preguntar a la IA

Me gusta

Guardar

Compartir

Ver artículo completo

Cite This Study

Kung et al. (Wed,) studied this question.

synapsesocial.com/papers/69df2b7dde200760a86148be https://doi.org/https://doi.org/10.1145/321906.321910

Also Consider

Synapse has enriched one closely related paper. Consider it for comparative context:

1The Art of Computer Programming: Volume 3: Sorting and Searching1973 · 3,979 citations