Sciweavers

298 search results - page 13 / 60
» Metric graph reconstruction from noisy data
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Novel beamformers for Multiple Correlated brain source localization and reconstruction
This paper introduces two novel beamforming algorithms, namely the Region Constrained and Multiple Correlated Source Model beamformers, designed to localize and to reconstruct hig...
Hung V. Dang, Kwong T. Ng, James K. Kroger
CVPR
2004
IEEE
14 years 9 months ago
Robust Subspace Clustering by Combined Use of kNND Metric and SVD Algorithm
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
Qifa Ke, Takeo Kanade
ICDE
2011
IEEE
281views Database» more  ICDE 2011»
12 years 11 months ago
Declarative analysis of noisy information networks
—There is a growing interest in methods for analyzing data describing networks of all types, including information, biological, physical, and social networks. Typically the data ...
Walaa Eldin Moustafa, Galileo Namata, Amol Deshpan...
ESWS
2007
Springer
14 years 1 months ago
A Performance and Scalability Metric for Virtual RDF Graphs
Abstract. From a theoretical point of view, the Semantic Web is understood in terms of a stack with RDF being one of its layers. A Semantic Web application operates on the common d...
Michael Hausenblas, Wolfgang Slany, Danny Ayers
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 9 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...