Sciweavers

4451 search results - page 438 / 891
» On Random Ordering Constraints
Sort
View
FOCS
2008
IEEE
16 years 1 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
ICASSP
2008
IEEE
16 years 1 months ago
Average case analysis of sparse recovery with thresholding : New bounds based on average dictionary coherence
This paper analyzes the performance of the simple thresholding algorithm for sparse signal representations. In particular, in order to be more realistic we introduce a new probabi...
Mohammad Golbabaee, Pierre Vandergheynst
ICPR
2008
IEEE
16 years 1 months ago
Direct 3-D shape recovery from image sequence based on multi-scale Bayesian network
We propose a new method for recovering a 3-D object shape from an image sequence. In order to recover high-resolution relative depth without using the complex Markov random field...
Norio Tagawa, Junya Kawaguchi, Shoichi Naganuma, K...
WCNC
2008
IEEE
16 years 1 months ago
Distributed Space-Frequency Coding over Amplify-and-Forward Relay Channels
Abstract— In this paper, the design of distributed spacefrequency codes (DSFCs) for wireless relay networks employing the amplify-and-forward (AAF) protocol is considered. The te...
Karim G. Seddik, K. J. Ray Liu
DATE
2007
IEEE
84views Hardware» more  DATE 2007»
16 years 1 months ago
On test generation by input cube avoidance
Test generation procedures attempt to assign values to the inputs of a circuit so as to detect target faults. We study a complementary view whereby the goal is to identify values ...
Irith Pomeranz, Sudhakar M. Reddy