Sciweavers

4313 search results - page 753 / 863
» Using time travel to diagnose computer problems
Sort
View
DCG
2010
289views more  DCG 2010»
13 years 9 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
INFORMATICALT
2007
152views more  INFORMATICALT 2007»
13 years 8 months ago
On the Application of Invariant Image Parameters to Fractal Encoding of Bi-Level Images
Abstract. Fractal image compression is an engaging and worthwhile technology that may be successfully applied to still image coding, especially at high compression ratios. Unfortun...
Jonas Valantinas, Tomas Zumbakis
MP
2002
85views more  MP 2002»
13 years 8 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
FPL
2010
Springer
124views Hardware» more  FPL 2010»
13 years 7 months ago
Finding System-Level Information and Analyzing Its Correlation to FPGA Placement
One of the more popular placement algorithms for Field Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement ...
Farnaz Gharibian, Lesley Shannon, Peter Jamieson
WPES
2003
ACM
14 years 2 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...