Sciweavers

2069 search results - page 135 / 414
» Linear time algorithms for Clobber
Sort
View
DAC
1998
ACM
15 years 8 months ago
Adjoint Transient Sensitivity Computation in Piecewise Linear Simulation
This paper presents a general method for computing transient sensitivities using the adjoint method in event driven simulation algorithms that employ piecewise linear device model...
Tuyen V. Nguyen, Anirudh Devgan, Ognen J. Nastov
ICMCS
2006
IEEE
119views Multimedia» more  ICMCS 2006»
15 years 10 months ago
Optimal Error Protection of Progressively Compressed 3D Meshes
Given a number of available layers of source data and a transmission bit budget, we propose an algorithm that determines how many layers should be sent and how many protection bit...
Shakeel Ahmad, Raouf Hamzaoui
AAIM
2006
Springer
143views Algorithms» more  AAIM 2006»
15 years 10 months ago
A Compression-Boosting Transform for Two-Dimensional Data
We introduce a novel invertible transform for two-dimensional data which has the objective of reordering the matrix so it will improve its (lossless) compression at later stages. T...
Qiaofeng Yang, Stefano Lonardi, Avraham Melkman
FOCS
1991
IEEE
15 years 8 months ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
15 years 9 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...