Sciweavers

2593 search results - page 381 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
14 years 3 months ago
Optimal sensor hop selection: Sensor energy minimization and network lifetime maximization with guaranteed system performance
— In this paper we consider state estimation carried over a sensor network. A fusion center forms a local multi-hop tree of sensors and gateways and fuses the data into a state e...
Ling Shi, Karl Henrik Johansson, Richard M. Murray
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 12 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
SIGGRAPH
1993
ACM
14 years 1 months ago
Hierarchical Z-buffer visibility
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
Ned Greene, Michael Kass, Gavin S. P. Miller
ACL
2010
13 years 7 months ago
Convolution Kernel over Packed Parse Forest
This paper proposes a convolution forest kernel to effectively explore rich structured features embedded in a packed parse forest. As opposed to the convolution tree kernel, the p...
Min Zhang, Hui Zhang, Haizhou Li
MICCAI
2000
Springer
14 years 19 days ago
Robust Midsagittal Plane Extraction from Coarse, Pathological 3D Images
Abstract. This paper focuses on the evaluation of an ideal midsagittal plane iMSP extraction algorithm. The algorithm was developed for capturing the iMSP from 3D normal and pathol...
Yanxi Liu, Robert T. Collins, William E. Rothfus