Sciweavers

4342 search results - page 103 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
STOC
2009
ACM
182views Algorithms» more  STOC 2009»
16 years 4 months ago
Approximating edit distance in near-linear time
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
Alexandr Andoni, Krzysztof Onak
121
Voted
ATAL
2004
Springer
15 years 9 months ago
Communication for Improving Policy Computation in Distributed POMDPs
Distributed Partially Observable Markov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to joi...
Ranjit Nair, Milind Tambe, Maayan Roth, Makoto Yok...
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
16 years 1 months ago
Speeding Up Secure Computations via Embedded Caching.
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setti...
K. Zhai, W. K. Ng, A. R. Herianto, S. Han
ECRTS
2003
IEEE
15 years 9 months ago
Fault-Tolerant Clock Synchronization for Embedded Distributed Multi-Cluster Systems
When time-triggered (TT) systems are to be deployed for large embedded real-time (RT) control systems in cars and airplanes, one way to overcome bandwidth limitations and achieve ...
Michael Paulitsch, Wilfried Steiner
DAC
2008
ACM
16 years 5 months ago
Energy-optimal software partitioning in heterogeneous multiprocessor embedded systems
Embedded systems with heterogeneous processors extend the energy/timing trade-off flexibility and provide the opportunity to fine tune resource utilization for particular applicat...
Michel Goraczko, Jie Liu, Dimitrios Lymberopoulos,...