Sciweavers

299 search results - page 17 / 60
» A Convex Relaxation Approach for Computing Minimal Partition...
Sort
View
CVPR
2005
IEEE
14 years 11 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
14 years 1 months ago
A clustering- and probability-based approach for time-multiplexed FPGA partitioning
Improving logic density by time-sharing, time-multiplexed FPGAs (TMFPGAs) have become an important research topic for reconfigurable computing. Due to the precedence and capacity ...
Mango Chia-Tso Chao, Guang-Ming Wu, Iris Hui-Ru Ji...
ICRA
2007
IEEE
106views Robotics» more  ICRA 2007»
14 years 3 months ago
Exploring Different Coherence Dimensions to Answer Proximity Queries for Convex Polyhedra
— Different coherence dimensions can be considered to improve the performances of an algorithm for computing collision translations of pairs of convex polyhedra. The algorithm’...
Claudio Mirolo, Stefano Carpin, Enrico Pagello
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 9 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
ICPP
2008
IEEE
14 years 3 months ago
Parallel Inferencing for OWL Knowledge Bases
Abstract— We examine the problem of parallelizing the inferencing process for OWL knowledge-bases. A key challenge in this problem is partitioning the computational workload of t...
Ramakrishna Soma, Viktor K. Prasanna