Sciweavers

2969 search results - page 153 / 594
» A space efficient algorithm for group structure computation
Sort
View
148
Voted
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
15 years 3 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
153
Voted
JACM
2006
112views more  JACM 2006»
15 years 3 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
CVPR
2005
IEEE
16 years 5 months ago
Hallucinating Faces: TensorPatch Super-Resolution and Coupled Residue Compensation
In this paper, we propose a new face hallucination framework based on image patches, which integrates two novel statistical super-resolution models. Considering that image patches...
Wei Liu, Dahua Lin, Xiaoou Tang
167
Voted
VIS
2009
IEEE
215views Visualization» more  VIS 2009»
16 years 4 months ago
Intrinsic Geometric Scale Space by Shape Diffusion
This paper formalizes a novel, intrinsic geometric scale space (IGSS) of 3D surface shapes. The intrinsic geometry of a surface is diffused by means of the Ricci flow for the gener...
Guangyu Zou, Jing Hua, Zhaoqiang Lai, Xianfeng ...
163
Voted
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 7 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...