2638 search results - page 73 / 528 » Random Geometric Complexes |
122
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
The richness of natural images makes the quest for optimal representations in image processing and computer vision challenging. The latter observation has not prevented the design...
154
Voted
FSTTCS
1992
Springer
15 years 6 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
123
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
CP
2007
Springer
15 years 8 months ago
2007
Springer
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
102
Voted
GIS
2008
ACM
15 years 3 months ago
2008
ACM
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...