2735 search results - page 99 / 547 » Generalized Displacement Maps |
137
click to vote
PG
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of generating a map between two triangulated meshes, M and M’, with arbitrary and possibly differing genus. This problem has rarely been tackled in its g...
147
click to vote
IEEEPACT
2006
IEEE
15 years 10 months ago
2006
IEEE
Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. The efficiency of a cache for this application critically depends on the ...
124
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
124
click to vote
VISSYM
2007
15 years 7 months ago
2007
Synchronous electrical activity in different brain regions is generally assumed to imply functional relationships between these regions. A measure for this synchrony is electroenc...
166
click to vote
BMCBI
2002
15 years 4 months ago
2002
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...