Sciweavers

591 search results - page 58 / 119
» Computing fundamental groups from point clouds
Sort
View
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
15 years 3 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
EMNLP
2008
15 years 15 days ago
Scalable Language Processing Algorithms for the Masses: A Case Study in Computing Word Co-occurrence Matrices with MapReduce
This paper explores the challenge of scaling up language processing algorithms to increasingly large datasets. While cluster computing has been available in commercial environment...
Jimmy J. Lin
COMPSAC
2007
IEEE
15 years 5 months ago
A Service Discovery Architecture based on Anycast in Pervasive Computing Environments
Service discovery is very useful in pervasive computing environments. A service discovery architecture based on anycast is proposed. A wellknown anycast address is defined first, ...
Li Zhang, Zhen-lian Shi, Qi Shen
83
Voted
ICASSP
2010
IEEE
14 years 11 months ago
Fast semi-supervised image segmentation by novelty selection
The goal of semi-supervised image segmentation is to obtain the segmentation from a partially labeled image. By utilizing the image manifold structure in labeled and unlabeled pix...
António R. C. Paiva, Tolga Tasdizen
ECCV
2002
Springer
16 years 28 days ago
Multi-scale EM-ICP: A Fast and Robust Approach for Surface Registration
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
Sébastien Granger, Xavier Pennec