13603 search results - page 41 / 2721 » On the Complexity of Computing Treelength |
ICASSP
2011
IEEE
13 years 24 days ago
2011
IEEE
— This paper proposes an efficient blind deterministic carrier frequency offset (CFO) estimation method for orthogonal frequency division multiplexing (OFDM) systems. In the pro...
CHI
2011
ACM
13 years 20 days ago
2011
ACM
Many people manage a complex assortment of digital information in their lives. Volunteer coordinators at nonprofit organizations are no exception; they collectively manage informa...
PODC
2011
ACM
12 years 12 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
JACM
2000
13 years 8 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...