Sciweavers

6368 search results - page 118 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
118
Voted
SRDS
2000
IEEE
15 years 7 months ago
Modeling Fault-Tolerant Mobile Agent Execution as a Sequence of Agreement Problems
Fault-tolerance is fundamental to the further development of mobile agent applications. In the context of mobile agents, fault-tolerance prevents a partial or complete loss of the...
Stefan Pleisch, André Schiper
99
Voted
CORR
2010
Springer
117views Education» more  CORR 2010»
15 years 1 days ago
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
Amit Chakrabarti, Oded Regev
122
Voted
ICIP
2001
IEEE
16 years 4 months ago
The curvelet transform for image denoising
We describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform [3] and the curvelet transform [7, 6]. Our implementations offer...
Emmanuel J. Candès
137
Voted
ICCAD
1995
IEEE
135views Hardware» more  ICCAD 1995»
15 years 6 months ago
An iterative improvement algorithm for low power data path synthesis
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
Anand Raghunathan, Niraj K. Jha
114
Voted
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
15 years 4 months ago
Making data structures confluently persistent
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
Amos Fiat, Haim Kaplan