Sciweavers

1951 search results - page 256 / 391
» An algorithm for improving graph partitions
Sort
View
INFOCOM
2008
IEEE
15 years 11 months ago
Distributed Operator Placement and Data Caching in Large-Scale Sensor Networks
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
Lei Ying, Zhen Liu, Donald F. Towsley, Cathy H. Xi...
VLSID
1996
IEEE
130views VLSI» more  VLSID 1996»
15 years 8 months ago
A systolic architecture for LMS adaptive filtering with minimal adaptation delay
Existing systolic architectures for the LMS algorithm with delayed coeficient adaptation have large adaptation delay and hence degraded convergence behaviour. This paper presents ...
S. Ramanathan, V. Visvanathan
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
15 years 2 months ago
How to Play Unique Games on Expanders
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
Konstantin Makarychev, Yury Makarychev
CVPR
2011
IEEE
15 years 20 days ago
Cross-View Action Recognition via View Knowledge Transfer
In this paper, we present a novel approach to recognizing human actions from different views by view knowledge transfer. An action is originally modelled as a bag of visual-words ...
Jingen Liu
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 8 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger