882 search results - page 134 / 177 » On the Hardness of Graph Isomorphism |
192
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
164
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
160
click to vote
MM
2005
ACM
15 years 11 months ago
2005
ACM
Learning the user’s semantics for CBIR involves two different sources of information: the similarity relations entailed by the content-based features, and the relevance relatio...
180
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
203
Voted
PLDI
2004
ACM
15 years 11 months ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...