4123 search results - page 237 / 825 » Multiple Relational Embedding |
177
click to vote
CCCG
2007
15 years 8 months ago
2007
We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
182
click to vote
CATS
2008
15 years 8 months ago
2008
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
159
click to vote
JEC
2006
15 years 6 months ago
2006
Chip multi-processors (CMP) are rapidly emerging as an important design paradigm for both high performance and embedded processors. These machines provide an important performance...
197
click to vote
ENTCS
2008
15 years 5 months ago
2008
Orc and Reo are two complementary approaches to the problem of coordinating components or services. On one hand, Orc is highly asynchronous, naturally dynamic, and based on epheme...
212
click to vote
AML
2011
15 years 1 months ago
2011
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...