2738 search results - page 305 / 548 » The Frobenius Problem and Its Generalizations |
194
click to vote
TALG
2008
15 years 6 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
165
click to vote
IVC
2007
15 years 6 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
152
click to vote
JIRS
2007
15 years 6 months ago
2007
— Today, there are many opportunities to create vision-based intelligent systems that are human-centric. This is a very rich area because humans are very complex, and the number ...
152
click to vote
TSP
2008
15 years 6 months ago
2008
We consider the problem of detecting a subspace signal in white Gaussian noise when the noise power may be different under the null hypothesis--where it is assumed to be known--and...
197
click to vote
VC
2008
15 years 6 months ago
2008
Abstract Mesh partitioning and skeletonisation are fundamental for many computer graphics and animation techniques. Because of the close link between an object's skeleton and ...