1539 search results - page 86 / 308 » Fast and Simple Methods For Computing Control Points |
126
Voted
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we consider the problem of tracking nonrigid surfaces and propose a generic data-driven mesh deformation framework. In contrast to methods using strong prior models...
115
Voted
DATE
2007
IEEE
15 years 9 months ago
2007
IEEE
We present a computationally efficient implementation of positive-real balanced truncation (PRBT) for symmetric multiple-input multiple-output (MIMO) systems. The solution of a p...
114
Voted
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
111
click to vote
ICRA
2002
IEEE
15 years 7 months ago
2002
IEEE
To meet the objectives of many future missions, robots will need to be adaptable and reconfigurable. A concept for such a robotic system has been proposed previously based on usin...
151
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...