1688 search results - page 120 / 338 » The Complexity of Rationalizing Matchings |
195
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
121
click to vote
ICIP
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a new descriptor and feature matching solution for omnidirectional images. The descriptor builds on the log-polar planar descriptors, but adapts to the specific geometr...
148
click to vote
IJCNN
2008
IEEE
16 years 6 days ago
2008
IEEE
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
141
Voted
HAPTICS
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we present a multi-modal data perceptualization system used to analyze the benefits of augmenting a volume docking problem with other perceptual cues, particularly...
159
click to vote
ISMIR
2004
Springer
15 years 11 months ago
2004
Springer
In the last few years, several algorithms for the automatic alignment of audio and score data corresponding to the same piece of music have been proposed. Among the major drawback...