Sciweavers

1399 search results - page 78 / 280
» New Algorithms for k-Center and Extensions
Sort
View
CGF
2002
123views more  CGF 2002»
13 years 9 months ago
A Frequency-Domain Approach to Watermarking 3D Shapes
This paper presents a robust watermarking algorithm with informed detection for 3D polygonal meshes. The algorithm is based on our previous algorithm [22] that employs mesh-spectr...
Ryutarou Ohbuchi, Akio Mukaiyama, Shigeo Takahashi
SC
2003
ACM
14 years 2 months ago
A Million-Fold Speed Improvement in Genomic Repeats Detection
This paper presents a novel, parallel algorithm for generating top alignments. Top alignments are used for finding internal repeats in biological sequences like proteins and gene...
John W. Romein, Jaap Heringa, Henri E. Bal
PC
2007
133views Management» more  PC 2007»
13 years 8 months ago
Data distribution for dense factorization on computers with memory heterogeneity
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
Alexey L. Lastovetsky, Ravi Reddy
ECOOP
1999
Springer
14 years 1 months ago
Multi-method Dispatch Using Multiple Row Displacement
Abstract. Multiple Row Displacement (MRD) is a new dispatch technique for multi-method languages. It is based on compressing an n-dimensional table using an extension of the single...
Candy Pang, Wade Holst, Yuri Leontiev, Duane Szafr...
CVPR
2006
IEEE
14 years 11 months ago
Efficient Optimal Kernel Placement for Reliable Visual Tracking
This paper describes a novel approach to optimal kernel placement in kernel-based tracking. If kernels are placed at arbitrary places, kernel-based methods are likely to be trappe...
Zhimin Fan, Ming Yang, Ying Wu, Gang Hua, Ting Yu