Sciweavers

948 search results - page 144 / 190
» What can we achieve by arbitrary announcements
Sort
View
IPPS
2010
IEEE
13 years 6 months ago
Dynamic load balancing on single- and multi-GPU systems
The computational power provided by many-core graphics processing units (GPUs) has been exploited in many applications. The programming techniques currently employed on these GPUs...
Long Chen, Oreste Villa, Sriram Krishnamoorthy, Gu...
ICPR
2008
IEEE
14 years 3 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
GRID
2006
Springer
13 years 8 months ago
Using Workflow for Dynamic Security Context Management in Grid-based Applications
This paper presents ongoing research and current results on the development of flexible access control infrastructures for complex resource provisioning in Grid-based collaborativ...
Yuri Demchenko, Leon Gommans, Cees de Laat, Arie T...
ICDE
2011
IEEE
194views Database» more  ICDE 2011»
13 years 16 days ago
Representative skylines using threshold-based preference distributions
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, R...
INFOCOM
1997
IEEE
14 years 1 months ago
A Near-Optimal Packet Scheduler for QoS Networks
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
Dallas E. Wrege, Jörg Liebeherr