Sciweavers

3946 search results - page 335 / 790
» The computational complexity of choice sets
Sort
View
CGF
2010
171views more  CGF 2010»
15 years 3 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
SMI
2003
IEEE
143views Image Analysis» more  SMI 2003»
16 years 3 days ago
Rough Surface Modeling Using Surface Growth
In this paper, we present a novel modeling method for synthesizing rough surfaces using discrete surface growth models. We employ a two-pass method. Initial point cluster data is ...
Yootai Kim, Raghu Machiraju, David Thompson
SAC
2008
ACM
15 years 6 months ago
Collaborative software engineering on large-scale models: requirements and experience in ModelBus
This work presents an approach for realizing Model-Driven software engineering in the distributed and multi-developers context. It particularly focuses on the scalability problems...
Prawee Sriplakich, Xavier Blanc, Marie-Pierre Gerv...
ACCV
2010
Springer
15 years 1 months ago
A Direct Method for Estimating Planar Projective Transform
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
Yu-Tseh Chi, Jeffrey Ho, Ming-Hsuan Yang
EDBT
2009
ACM
175views Database» more  EDBT 2009»
16 years 1 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...