42 search results - page 7 / 9 » Finding a Two-Core of a Tree in Linear Time |
130
Voted
RECOMB
2006
Springer
16 years 4 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...
147
Voted
CVPR
2007
IEEE
16 years 5 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...
146
Voted
SODA
2010
ACM
16 years 1 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 ...
145
Voted
ORL
2006
15 years 3 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...
153
Voted
GLOBECOM
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by...