Sciweavers

776 search results - page 132 / 156
» Distributed Information Regularization on Graphs
Sort
View
COMCOM
2004
153views more  COMCOM 2004»
15 years 1 months ago
BLR: beacon-less routing algorithm for mobile ad hoc networks
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
Marc Heissenbüttel, Torsten Braun, Thomas Ber...
ICDE
2010
IEEE
220views Database» more  ICDE 2010»
14 years 12 months ago
Profiling linked open data with ProLOD
Linked open data (LOD), as provided by a quickly growing number of sources constitutes a wealth of easily accessible information. However, this data is not easy to understand. It i...
Christoph Böhm, Felix Naumann, Ziawasch Abedj...
120
Voted
VRST
2004
ACM
15 years 7 months ago
The MORGAN framework: enabling dynamic multi-user AR and VR projects
The availability of a suitable framework is of vital importance for the development of Augmented Reality (AR) and Virtual Reality (VR) projects. While features such as scalability...
Jan Ohlenburg, Iris Herbst, Irma Lindt, Torsten Fr...
PODC
2009
ACM
16 years 2 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...
IPPS
1998
IEEE
15 years 6 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
Sven Venema, Hong Shen, Francis Suraweera