Sciweavers

3958 search results - page 696 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
SAC
2009
ACM
14 years 4 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe
LCPC
2005
Springer
14 years 3 months ago
Loop Selection for Thread-Level Speculation
Thread-level speculation (TLS) allows potentially dependent threads to speculatively execute in parallel, thus making it easier for the compiler to extract parallel threads. Howeve...
Shengyue Wang, Xiaoru Dai, Kiran Yellajyosula, Ant...
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
13 years 8 months ago
Using data mining techniques to address critical information exchange needs in disaster affected public-private networks
Crisis Management and Disaster Recovery have gained immense importance in the wake of recent man and nature inflicted calamities. A critical problem in a crisis situation is how t...
Li Zheng, Chao Shen, Liang Tang, Tao Li, Steven Lu...
MM
2006
ACM
93views Multimedia» more  MM 2006»
14 years 4 months ago
Scaling laws and tradeoffs in peer-to-peer live multimedia streaming
It is well-known that live multimedia streaming applications operate more efficiently when organized in peer-to-peer (P2P) topologies, since peer upload capacities are utilized t...
Tara Small, Ben Liang, Baochun Li
FCCM
1999
IEEE
134views VLSI» more  FCCM 1999»
14 years 2 months ago
Runlength Compression Techniques for FPGA Configurations
The time it takes to reconfigure FPGAs can be a significant overhead for reconfigurable computing. In this paper we develop new compression algorithms for FPGA configurations that...
Scott Hauck, William D. Wilson