Sciweavers

523 search results - page 41 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
FOCS
1997
IEEE
15 years 5 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
15 years 6 months ago
Online Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
Leah Epstein, Rob van Stee
ICASSP
2011
IEEE
14 years 5 months ago
Logarithmic weak regret of non-Bayesian restless multi-armed bandit
Abstract—We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. At each time, a player chooses K out of N (N > K) arms to play. The state of each ar...
Haoyang Liu, Keqin Liu, Qing Zhao
ICASSP
2009
IEEE
15 years 8 months ago
Analyzing Least Squares and Kalman Filtered Compressed Sensing
In recent work, we studied the problem of causally reconstructing time sequences of spatially sparse signals, with unknown and slow time-varying sparsity patterns, from a limited ...
Namrata Vaswani
ICASSP
2007
IEEE
15 years 7 months ago
An Affine Invariant Function using PCA Bases with an Application to Within-Class Object Recognition
The problem of shape-based recognition of objects under affine transformations is considered. We focus on the construction of a robust and highly discriminative affine invariant...
Georgios Tzimiropoulos, Nikolaos Mitianoudis, Tani...