Sciweavers

1888 search results - page 314 / 378
» Information Distance
Sort
View
IM
2008
14 years 9 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
COGSCI
2007
139views more  COGSCI 2007»
14 years 9 months ago
Mapping the Color Space of Saccadic Selectivity in Visual Search
Color coding is used to guide attention in computer displays for such critical tasks as baggage screening or air traffic control. It has been shown that a display object attracts...
Yun Xu, Emily C. Higgins, Mei Xiao, Marc Pomplun
CORR
2007
Springer
77views Education» more  CORR 2007»
14 years 9 months ago
Quantization Bounds on Grassmann Manifolds of Arbitrary Dimensions and MIMO Communications with Feedback
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
Wei Dai, Youjian Liu, Brian Rider
JMIV
2006
130views more  JMIV 2006»
14 years 9 months ago
Alternative 2D Shape Representations using the Symmetry Set
Among the many attempts made to represent families of 2D shapes in a simpler way, the Medial Axis (MA) takes a prominent place. Its graphical representation is intuitively appealin...
Arjan Kuijper, Ole Fogh Olsen, Peter J. Giblin, Ma...
PAMI
2008
270views more  PAMI 2008»
14 years 9 months ago
Randomized Clustering Forests for Image Classification
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
Frank Moosmann, Eric Nowak, Frédéric...