Sciweavers

77 search results - page 11 / 16
» On the Spectrum of the Derangement Graph
Sort
View
GLOBECOM
2006
IEEE
14 years 1 months ago
On the Search of Internet AS-level Topology Invariants
— There has been a significant amount of work analyzing the Internet AS (Autonomous System)-level topology which gives rise to a number of topology models. Although each of thes...
Lung-de Shyu, Seng-Yong Lau, Polly Huang
SIGMOD
2008
ACM
89views Database» more  SIGMOD 2008»
14 years 7 months ago
Towards identity anonymization on graphs
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
Kun Liu, Evimaria Terzi
MICRO
2007
IEEE
141views Hardware» more  MICRO 2007»
14 years 1 months ago
Composable Lightweight Processors
Modern chip multiprocessors (CMPs) are designed to exploit both instruction-level parallelism (ILP) within processors and thread-level parallelism (TLP) within and across processo...
Changkyu Kim, Simha Sethumadhavan, M. S. Govindan,...
JSYML
2007
66views more  JSYML 2007»
13 years 7 months ago
Spectra of structures and relations
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
Valentina S. Harizanov, Russel G. Miller
PAMI
2007
196views more  PAMI 2007»
13 years 7 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock