Sciweavers

1439 search results - page 176 / 288
» Fast approximation of centrality
Sort
View
82
Voted
CORR
2011
Springer
158views Education» more  CORR 2011»
14 years 7 months ago
The power and Arnoldi methods in an algebra of circulants
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each “...
David F. Gleich, Chen Greif, James M. Varah
117
Voted
TELSYS
2010
147views more  TELSYS 2010»
14 years 7 months ago
A new worm propagation threat in BitTorrent: modeling and analysis
Peer-to-peer (p2p) networking technology has gained popularity as an efficient mechanism for users to obtain free services without the need for centralized servers. Protecting thes...
Sinan Hatahet, Abdelmadjid Bouabdallah, Yacine Cha...
TON
2010
139views more  TON 2010»
14 years 7 months ago
Opportunistic and Cooperative Spatial Multiplexing in MIMO Ad Hoc Networks
With the fast progress of MIMO technology and its growing applications in networks, it is important to develop techniques to enable more efficient MIMO network communications. Howe...
Shan Chu, Xin Wang
ICCV
2009
IEEE
16 years 5 months ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs
CVPR
2004
IEEE
16 years 2 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen