Sciweavers

549 search results - page 49 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 2 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
EUROPAR
2007
Springer
15 years 1 months ago
An Evaluation of Parallelization Concepts for Baseline-Profile Compliant H.264/AVC Decoders
Due to the increasing performance requirements of decoding H.264/AVC in HDTV or larger resolutions, new approaches are necessary to enable real-time processing. According to the cu...
Klaus Schöffmann, Markus Fauster, Oliver Lamp...
EGPGV
2011
Springer
366views Visualization» more  EGPGV 2011»
14 years 1 months ago
GPU Algorithms for Diamond-based Multiresolution Terrain Processing
We present parallel algorithms for processing, extracting and rendering adaptively sampled regular terrain datasets represented as a multiresolution model defined by a super-squa...
M. Adil Yalçin, Kenneth Weiss, Leila De Flo...
SAC
2002
ACM
14 years 9 months ago
A comprehensive model for arbitrary result extraction
Within the realms of workflow management and grid computing, scheduling of distributed services is a central issue. Most schedulers balance time and cost to fit within a client�...
Neal Sample, Dorothea Beringer, Gio Wiederhold
PODC
2009
ACM
15 years 10 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch