52 search results - page 1 / 11 » Finding the maximum and minimum elements with one lie |
DAM
2010
13 years 4 months ago
2010
ALGORITHMICA
2005
13 years 4 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
IPMI
2003
Springer
14 years 5 months ago
2003
Springer
The Gaussian distribution is the basis for many methods used in the statistical analysis of shape. One such method is principal component analysis, which has proven to be a powerfu...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
EPS
1998
Springer
13 years 9 months ago
1998
Springer
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...