Sciweavers

2084 search results - page 410 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
83
Voted
MOBISYS
2007
ACM
15 years 9 months ago
Context-for-wireless: context-sensitive energy-efficient wireless data transfer
Ubiquitous connectivity on mobile devices will enable numerous new applications in healthcare and multimedia. We set out to check how close we are towards ubiquitous connectivity ...
Ahmad Rahmati, Lin Zhong
VLDB
1998
ACM
136views Database» more  VLDB 1998»
15 years 1 months ago
Materialized View Selection for Multidimensional Datasets
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton
ICDCS
2009
IEEE
14 years 7 months ago
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang
MMS
2000
14 years 9 months ago
SMDP: Minimizing Buffer Requirements for Continuous Media Servers
Excessive buffer requirement to handle continuous-media playbacks is an impediment to costeffective provisioning for on-line video retrieval. Given the skewed distribution of video...
Youjip Won, Jaideep Srivastava
CGO
2008
IEEE
15 years 4 months ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout