48 search results - page 8 / 10 » Graph partitioning via adaptive spectral techniques |
TCC
2007
Springer
15 years 3 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
APVIS
2009
14 years 10 months ago
2009
Visualizing large-scale online social network is a challenging yet essential task. This paper presents HiMap, a system that visualizes it by clustered graph via hierarchical group...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper examines the dynamics of a networked multi-agent system operating with a consensus-type coordination algorithm that can be influenced by external agents. We refer to thi...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
MDM
2007
Springer
15 years 3 months ago
2007
Springer
Data broadcast is a technique to realize energy saving and bandwidth utilization in a mobile computing environment. However, traditional schemes schedule data items without consid...