5606 search results - page 254 / 1122 » Randomization Techniques for Graphs. |
163
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
214
click to vote
RSA
2006
15 years 6 months ago
2006
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
156
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
170
click to vote
ICCAD
2007
IEEE
16 years 3 months ago
2007
IEEE
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...
155
click to vote
DATE
2005
IEEE
16 years 3 days ago
2005
IEEE
— Sharing IP blocks in today’s competitive market poses significant high security risks. Creators and owners of IP designs want assurances that their content will not be illeg...