Sciweavers

1538 search results - page 84 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
PVLDB
2010
151views more  PVLDB 2010»
14 years 12 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
Kathy Macropol, Ambuj K. Singh
ECML
2005
Springer
15 years 7 months ago
Nonrigid Embeddings for Dimensionality Reduction
Spectral methods for embedding graphs and immersing data manifolds in low-dimensional speaces are notoriously unstable due to insufficient and/or numberically ill-conditioned con...
Matthew Brand
145
Voted
CVPR
2012
IEEE
13 years 3 months ago
Video segmentation by tracing discontinuities in a trajectory embedding
Our goal is to segment a video sequence into moving objects and the world scene. In recent work, spectral embedding of point trajectories based on 2D motion cues accumulated from ...
Katerina Fragkiadaki, Geng Zhang, Jianbo Shi
EDBT
2009
ACM
132views Database» more  EDBT 2009»
15 years 8 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
VTC
2007
IEEE
152views Communications» more  VTC 2007»
15 years 7 months ago
Iterative (TURBO) IQ Imbalance Estimation and Correction in BICM-ID for Flat Fading Channels
—TURBO principle has been exploited gainfully to implement many receiver functions. RF front-end impairments are a serious issue in high spectral efficient applications. IQ imba...
Raghunath Cherukuri, Poras T. Balsara