Sciweavers

248 search results - page 20 / 50
» Geometrical Probability Covering Algorithm
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 9 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
WPES
2006
ACM
15 years 3 months ago
Nonesuch: a mix network with sender unobservability
Oblivious submission to anonymity systems is a process by which a message may be submitted in such a way that neither the anonymity network nor a global passive adversary may dete...
Thomas S. Heydt-Benjamin, Andrei Serjantov, Beness...
CGF
1999
91views more  CGF 1999»
14 years 9 months ago
Efficient and Handy Texture Mapping on 3D Surfaces
There has been a rapid technical progress in three-dimensional (3D) computer graphics. But gathering surface and texture data is yet a laborious task. This paper addresses the pro...
Kenji Matsushita, Toyohisa Kaneko
ICPR
2000
IEEE
15 years 2 months ago
Statistical-Based Approach to Word Segmentation
Thispaper presents a text word extraction algorithm that takes a set of bounding boxes of glyphs and their associated text lines of a given document andpartitions the glyphs into ...
Yalin Wang, Robert M. Haralick, Ihsin T. Phillips
COMPGEOM
2006
ACM
15 years 3 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...