Sciweavers

458 search results - page 26 / 92
» Totally magic graphs
Sort
View
CVPR
1997
IEEE
13 years 12 months ago
Normalized Cuts and Image Segmentation
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...
Jianbo Shi, Jitendra Malik
CISS
2007
IEEE
13 years 11 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami
EOR
2006
110views more  EOR 2006»
13 years 7 months ago
A constructive algorithm for realizing a distance matrix
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
Sacha C. Varone
ICASSP
2010
IEEE
13 years 6 months ago
Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
Sunil K. Narang, Godwin Shen, Antonio Ortega
COCOON
2009
Springer
14 years 2 months ago
Convex Partitions with 2-Edge Connected Dual Graphs
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaqu...