Sciweavers

7913 search results - page 111 / 1583
» Information Collection on a Graph
Sort
View
IJISTA
2008
87views more  IJISTA 2008»
13 years 9 months ago
On fusion of range and intensity information using Graph-Cut for planar patch segmentation
: Planar patch detection aims at simplifying data from 3-D imaging sensors to a more compact scene description. We propose a fusion of intensity and depth information using Graph-C...
Olaf Kähler, Erik Rodner, Joachim Denzler
CN
2010
121views more  CN 2010»
13 years 5 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
SENSYS
2003
ACM
14 years 2 months ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 11 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
NIPS
2004
13 years 10 months ago
Distributed Information Regularization on Graphs
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expres...
Adrian Corduneanu, Tommi Jaakkola