Sciweavers

2084 search results - page 224 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
DAC
2006
ACM
15 years 11 months ago
Timing driven power gating
Power Gating is effective for reducing leakage power. Previously, a Distributed Sleep Transistor Network (DSTN) was proposed to reduce the sleep transistor area by connecting all ...
De-Shiuan Chiou, Shih-Hsin Chen, Shih-Chieh Chang,...
GRID
2006
Springer
14 years 10 months ago
Resource Allocation in Streaming Environments
This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large comp...
Lu Tian, K. Mani Chandy
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
15 years 10 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
ICPR
2008
IEEE
15 years 4 months ago
Topologically correct surface reconstruction using alpha shapes and relations to ball-pivoting
The problem to reconstruct a surface given a finite set of boundary points is of growing interest, e.g. in the context of laser range images. While a lot of heuristic methods hav...
Peer Stelldinger
94
Voted
PPAM
2005
Springer
15 years 3 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale