GD
2006
Springer
13 years 11 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
GD
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
DCC
2006
IEEE
13 years 11 months ago
2006
IEEE
DCC
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
EGH
2004
Springer
13 years 11 months ago
2004
Springer
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
EGH
2004
Springer
13 years 11 months ago
2004
Springer
Utilizing graphics hardware for general purpose numerical computations has become a topic of considerable interest. The implementation of streaming algorithms, typified by highly ...
CGI
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we apply Nystr
CGI
2006
IEEE
13 years 11 months ago
2006
IEEE
Mesh chartification is an important tool for processing meshes in various applications. In this paper, we present a novel feature sensitive mesh chartification technique that can h...
CGI
2006
IEEE
13 years 11 months ago
2006
IEEE
CGI
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper tackles a particular shape matching problem: given a data base of shapes (described as triangular meshes), we search for all shapes which describe a human. We do so by a...