42 search results - page 7 / 9 » Finding a 2-Core of a Tree in Linear Time |
RECOMB
2006
Springer
14 years 7 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
EGH
2009
Springer
13 years 5 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
ORL
2006
13 years 7 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...