Sciweavers

2638 search results - page 209 / 528
» Random Geometric Complexes
Sort
View
ICCV
2011
IEEE
14 years 6 months ago
Decision Tree Fields
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
Sebastian Nowozin, Carsten Rother, Shai Bagon, Ban...
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 6 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
DCC
2005
IEEE
16 years 6 months ago
A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
Darko Kirovski
HICSS
2006
IEEE
152views Biometrics» more  HICSS 2006»
16 years 18 days ago
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan...
VIS
2004
IEEE
111views Visualization» more  VIS 2004»
16 years 7 months ago
Volume Refinement Fairing Isosurfaces
We propose an interpolating refinement method for two- and threedimensional scalar fields defined on hexahedral grids. Iterative fairing of the underlying contours (isosurfaces) p...
Martin Bertram