Sciweavers

420 search results - page 69 / 84
» Search on High Degree Graphs
Sort
View
FSTTCS
2004
Springer
14 years 3 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
PODC
2010
ACM
14 years 1 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
NIPS
2001
13 years 11 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
KDD
2002
ACM
286views Data Mining» more  KDD 2002»
14 years 10 months ago
Object Boundary Detection For Ontology-Based Image Classification
Technology in the field of digital media generates huge amounts of non-textual information, audio, video, and images, along with more familiar textual information. The potential f...
Lei Wang, Latifur Khan, Casey Breen
P2P
2009
IEEE
122views Communications» more  P2P 2009»
14 years 4 months ago
Virtual Direction Routing for Overlay Networks
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...