2638 search results - page 22 / 528 » Random Geometric Complexes |
117
click to vote
ICIP
2007
IEEE
16 years 3 months ago
2007
IEEE
Abstract-- This paper presents an edge-directed image interpolation algorithm. In the proposed algorithm, the edge directions are implicitly estimated with a statistical-based appr...
103
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— A geometric decoding technique for finite lattices was presented by Seethaler et al. for flat-fading multiple-input multiple-output channels in the case of linear modulations...
190
click to vote
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
111
click to vote
DIALM
2008
ACM
15 years 3 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
139
click to vote
PAMI
2010
15 years 10 days ago
2010
—This paper presents a robust and automatic approach to photometric stereo, where the two main components, namely surface normals and visible surfaces, are respectively optimized...