Sciweavers

976 search results - page 32 / 196
» Evaluating Adversarial Partitions
Sort
View
CSE
2009
IEEE
13 years 7 months ago
Edge Anonymity in Social Network Graphs
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
Lijie Zhang, Weining Zhang
DSOM
2005
Springer
14 years 3 months ago
Utilization and SLO-Based Control for Dynamic Sizing of Resource Partitions
This paper deals with a shared server environment where the server is divided into a number of resource partitions and used to host multiple applications at the same time. In a cas...
Zhikui Wang, Xiaoyun Zhu, Sharad Singhal
EGH
2004
Springer
14 years 1 months ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan
HIS
2008
13 years 11 months ago
Improving the Performance of Partitioning Methods for Crowd Simulations
Simulating the realistic behavior of large crowds of autonomous agents is still a challenge for the computer graphics community. In order to handle large crowds, some scalable arc...
Guillermo Vigueras, Miguel Lozano, Juan Manuel Ord...
ICML
2004
IEEE
14 years 10 months ago
Solving cluster ensemble problems by bipartite graph partitioning
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
Xiaoli Zhang Fern, Carla E. Brodley