Sciweavers

2924 search results - page 505 / 585
» Lower Bounds in Distributed Computing
Sort
View
JCB
2006
115views more  JCB 2006»
15 years 4 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
TIT
2008
116views more  TIT 2008»
15 years 4 months ago
On the Complexity of Hardness Amplification
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...
Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu
TSP
2008
115views more  TSP 2008»
15 years 4 months ago
Sinusoidal Modeling and Adaptive Channel Prediction in Mobile OFDM Systems
We propose a wireless fading channel prediction algorithm for a pilot-symbol aided Orthogonal Frequency Division Multiplexing (OFDM) system. Assuming a doubly selective (time and ...
Ian C. Wong, Brian L. Evans
MP
2002
85views more  MP 2002»
15 years 3 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
TIP
1998
128views more  TIP 1998»
15 years 3 months ago
Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of varia...
Antonin Chambolle, Ronald A. DeVore, Nam-Yong Lee,...