Sciweavers

5153 search results - page 448 / 1031
» Introduction to Randomized Algorithms
Sort
View
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
16 years 6 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 6 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
DCC
2003
IEEE
16 years 5 months ago
Estimation-Quantization Geometry Coding Using Normal Meshes
We propose a new algorithm for compressing three-dimensional triangular mesh data used for representing surfaces. We apply the EstimationQuantization (EQ) algorithm originally des...
Sridhar Lavu, Hyeokho Choi, Richard G. Baraniuk
VTC
2007
IEEE
164views Communications» more  VTC 2007»
16 years 15 days ago
Joint Distributed Clustering and Ranging for Wireless Ad-Hoc Sensor Networks
— This paper discusses a joint decentralized clustering and ranging algorithm for wireless ad-hoc sensor networks. Each sensor uses a random waiting timer and local criteria to d...
Chih-Yu Wen, Jun-Koh Chen, William A. Sethares
MIDDLEWARE
2005
Springer
15 years 11 months ago
Frugal Event Dissemination in a Mobile Environment
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...
Sébastien Baehni, Chirdeep Singh Chhabra, R...