Sciweavers

5138 search results - page 647 / 1028
» Low-Entropy Set Selection.
Sort
View
ICC
2007
IEEE
121views Communications» more  ICC 2007»
16 years 1 months ago
Opportunistic Scheduling for Wireless Network Coding
— This paper addresses a scheduling problem for wireless network coding which has been recently proposed as a novel method to enhance the throughput in wireless networks. The wir...
Hiroyuki Yomo, Petar Popovski
INFOCOM
2007
IEEE
16 years 1 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
ISVD
2007
IEEE
16 years 1 months ago
From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a fi...
Károly Bezdek
163
Voted
SMI
2007
IEEE
164views Image Analysis» more  SMI 2007»
16 years 1 months ago
Automatic multiview quadruple alignment of unordered range scans
This paper presents a new multiview alignment algorithm that performs both the coarse and fine alignment of unordered sets of range scans. Our algorithm selects quadruples of ran...
Frank B. ter Haar, Remco C. Veltkamp
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
16 years 28 days ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...