Sciweavers

2745 search results - page 297 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
PCM
2005
Springer
107views Multimedia» more  PCM 2005»
15 years 10 months ago
Auto-summarization of Multimedia Meeting Records Based on Accessing Log
Abstract. Computer techniques have been leveraged to record human experiences in many public spaces, e.g. meeting rooms and classrooms. For the large amount of such records produce...
Weisheng He, Yuanchun Shi, Xin Xiao
TSP
2010
14 years 11 months ago
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...
Qing Ling, Zhi Tian
157
Voted
INTERNET
2006
157views more  INTERNET 2006»
15 years 5 months ago
Distributed Data Mining in Peer-to-Peer Networks
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new dist...
Souptik Datta, Kanishka Bhaduri, Chris Giannella, ...
FCCM
2005
IEEE
139views VLSI» more  FCCM 2005»
15 years 10 months ago
A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation
Just-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously in...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan
154
Voted
CGI
1998
IEEE
15 years 9 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...