727 search results - page 87 / 146 » One line and n points |
SHAPE
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. We propose a general method for finding pointwise correspondence between 2-D shapes based on the concept of order structure and using geometric hashing. The problem of ...
CMMR
2008
Springer
14 years 12 months ago
2008
Springer
Realtime musical expression through synthesis is notoriously dicult. The complete potential of a sound engine is traditionally available only at design time. In this paper two mapp...
102
click to vote
PPOPP
2011
ACM
14 years 28 days ago
2011
ACM
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...
82
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...