Sciweavers

170 search results - page 5 / 34
» Reducing the Number of Queries in Interactive Value Iteratio...
Sort
View
92
Voted
3DIM
2001
IEEE
15 years 1 months ago
The Parallel Iterative Closest Point Algorithm
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calcul...
Christian Langis, Michael A. Greenspan, Guy Godin
WWW
2011
ACM
14 years 4 months ago
OXPath: little language, little memory, great value
Data about everything is readily available on the web—but often only accessible through elaborate user interactions. For automated decision support, extracting that data is esse...
Andrew Jon Sellers, Tim Furche, Georg Gottlob, Gio...
CVPR
2008
IEEE
15 years 11 months ago
FuzzyMatte: A computationally efficient scheme for interactive matting
In this paper, we propose an online interactive matting algorithm, which we call FuzzyMatte. Our framework is based on computing the fuzzy connectedness (FC) [20] from each unknow...
Yuanjie Zheng, Chandra Kambhamettu, Jingyi Yu, Tho...
SI3D
2005
ACM
15 years 3 months ago
Reducing blendshape interference by selected motion attenuation
Blendshapes (linear shape interpolation models) are perhaps the most commonly employed technique in facial animation practice. A major problem in creating blendshape animation is ...
John P. Lewis, Jonathan Mooser, Zhigang Deng, Ulri...
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
15 years 1 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin