Sciweavers

7006 search results - page 922 / 1402
» Approximation Algorithms
Sort
View
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 2 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 8 months ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup
ANOR
2010
130views more  ANOR 2010»
15 years 5 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
TASLP
2008
136views more  TASLP 2008»
15 years 7 months ago
Distortion Estimation in Compressed Music Using Only Audio Fingerprints
Abstract--An audio fingerprint is a compact yet very robust representation of the perceptually relevant parts of an audio signal. It can be used for content-based audio identificat...
Peter Jan O. Doets, Reginald L. Lagendijk
TWC
2008
238views more  TWC 2008»
15 years 7 months ago
Downlink resource allocation in multi-carrier systems: frequency-selective vs. equal power allocation
In this paper, a dynamic subcarrier and power allocation problem is considered in the context of asymptotic utility maximization in multi-carrier systems. Using the gradient-based...
Hyang-Won Lee, Song Chong