Sciweavers

1385 search results - page 95 / 277
» Clustering by Random Projections
Sort
View
EJC
2007
15 years 5 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
MIA
2010
170views more  MIA 2010»
14 years 12 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...
FTML
2010
159views more  FTML 2010»
15 years 3 months ago
Dimension Reduction: A Guided Tour
We give a tutorial overview of several geometric methods for dimension reduction. We divide the methods into projective methods and methods that model the manifold on which the da...
Christopher J. C. Burges
COMPGEOM
2010
ACM
15 years 10 months ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
ICCD
1997
IEEE
94views Hardware» more  ICCD 1997»
15 years 9 months ago
Pseudo-Random Pattern Testing of Bridging Faults
: This paper studies pseudo-random pattern testing of bridging faults. Although bridging faults are generally more random pattern testable than stuck-at faults, examples are shown ...
Nur A. Touba, Edward J. McCluskey