Sciweavers

3757 search results - page 385 / 752
» The overlap number of a graph
Sort
View
206
Voted
ECCC
2010
143views more  ECCC 2010»
15 years 4 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
HPDC
2009
IEEE
16 years 1 months ago
Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
Björn Saballus, Thomas Fuhrmann
VIS
2003
IEEE
145views Visualization» more  VIS 2003»
16 years 8 months ago
Signed Distance Transform Using Graphics Hardware
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-di...
Christian Sigg, Markus H. Gross, Ronald Peikert
ICML
2000
IEEE
16 years 7 months ago
Discovering Homogeneous Regions in Spatial Data through Competition
If all features causing heterogeneity were observed, a mixture of experts approach (Jacobs et al., 1991) is likely to be superior to using a single model. When unobserved or very n...
Slobodan Vucetic, Zoran Obradovic
WWW
2003
ACM
16 years 7 months ago
A Unified Abstraction for Messaging on the Semantic Web
d Abstraction for Messaging on the Semantic Web Dennis Quan IBM Internet Technology 1 Rogers Street Cambridge, MA 02142 USA dennisq@us.ibm.com Karun Bakshi MIT Artificial Intellige...
Dennis Quan, Karun Bakshi, David R. Karger