4212 search results - page 362 / 843 » On Compressible Pairings and Their Computation |
140
click to vote
WG
1992
Springer
15 years 11 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
132
Voted
CONEXT
2008
ACM
15 years 8 months ago
2008
ACM
We address the problem of finding indirect overlay paths that reduce the latency between pairs of nodes in an overlay. To this end we propose to rely on an Internet Coordinate Sys...
195
click to vote
DGCI
2009
Springer
15 years 8 months ago
2009
Springer
To find corresponding points in different poses of the same articulated shape, a non rigid coordinate system is used. Each pixel of each shape is identified by a pair of distinct c...
149
click to vote
AI
2007
Springer
15 years 7 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
206
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...