3941 search results - page 75 / 789 » Computational Efficiency of Batching Methods |
ECCV
2008
Springer
14 years 10 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...
AUTONOMICS
2007
ACM
14 years 28 days ago
2007
ACM
Abstract. Adaptation of devices and applications based on contextual information has a great potential to enhance usability and mitigate the increasing complexity of mobile devices...
IPPS
2008
IEEE
14 years 3 months ago
2008
IEEE
— When an adaptive software component is employed to select the best-performing implementation for a communication operation at runtime, the correctness of the decision taken str...
PAMI
2010
13 years 7 months ago
2010
—Representing 2D and 3D data sets with implicit polynomials (IPs) has been attractive because of its applicability to various computer vision issues. Therefore, many IP fitting m...
CG
2004
Springer
13 years 8 months ago
2004
Springer
We present a framework for processing point-based surfaces via partial differential equations (PDEs). Our framework efficiently and effectively brings well-known PDE-based process...