Sciweavers

2638 search results - page 145 / 528
» Random Geometric Complexes
Sort
View
CVPR
2012
IEEE
13 years 8 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
ECMDAFA
2009
Springer
109views Hardware» more  ECMDAFA 2009»
16 years 1 months ago
Uniform Random Generation of Huge Metamodel Instances
The size and the number of models is drastically increasing, preventing organizations from fully exploiting Model Driven Engineering benefits. Regarding this problem of scalabilit...
Alix Mougenot, Alexis Darrasse, Xavier Blanc, Mich...
MTDT
2000
IEEE
129views Hardware» more  MTDT 2000»
15 years 10 months ago
Using GLFSRs for Pseudo-Random Memory BIST
In this work, we present the application of Generalized Linear Feedback Shift Registers (GLFSRs) for generation of patterns for pseudo-random memory Built-In SelfTest (BIST). Rece...
Michael Redeker, Markus Rudack, Thomas Lobbe, Dirk...
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
15 years 10 months ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
15 years 8 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan