Sciweavers

2479 search results - page 130 / 496
» Random Event Structures
Sort
View
116
Voted
ICIP
2010
IEEE
14 years 11 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
122
Voted
TSP
2012
13 years 8 months ago
Randomized Isometric Linear-Dispersion Space-Time Block Coding for the DF Relay Channel
This article presents a randomized linear-dispersion space-time block code for decode-andforward synchronous relays. The coding matrices are obtained as a set of columns (or rows)...
David Gregoratti, Walid Hachem, Xavier Mestre
110
Voted
PODS
2006
ACM
127views Database» more  PODS 2006»
16 years 1 months ago
Evolution of page popularity under random web graph models
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...
Rajeev Motwani, Ying Xu 0002
103
Voted
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
15 years 7 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
100
Voted
ISAAC
2004
Springer
107views Algorithms» more  ISAAC 2004»
15 years 6 months ago
On the Hardness and Easiness of Random 4-SAT Formulas
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
Andreas Goerdt, André Lanka