2254 search results - page 273 / 451 » Computing the minimal covering set |
197
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
Geodesic curves in surfaces are not only minimizers of distance, but they are also the curves of zero geodesic (sideways) curvature. It turns out that this property makes patterns...
207
click to vote
ALP
1992
Springer
15 years 10 months ago
1992
Springer
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
153
click to vote
NOSSDAV
1992
Springer
15 years 10 months ago
1992
Springer
Tactus addresses problems of synchronizing and controlling various interactive continuous-time media. The Tactus system consists of two main parts. The first is a server that synch...
190
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper, we propose a novel and robust algorithm for the groupwise non-rigid registration of multiple unlabeled point-sets with no bias toward any of the given pointsets. To...
221
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....