Sciweavers

355 search results - page 37 / 71
» A New Approximation Technique for Resource-Allocation Proble...
Sort
View
ICA
2010
Springer
14 years 12 months ago
An Alternating Minimization Method for Sparse Channel Estimation
The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in many fields of communication including acoustic underwater or wireless transmissions...
Rad Niazadeh, Massoud Babaie-Zadeh, Christian Jutt...
ICRA
2000
IEEE
125views Robotics» more  ICRA 2000»
15 years 4 months ago
Force-Based Motion Editing for Locomotion Tasks
This paper describes a fast technique for modifying motion sequences for complex articulated mechanisms in a way that preserves physical properties of the motion. This technique i...
Nancy S. Pollard, Fareed Behmaram-Mosavat
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 3 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
14 years 11 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
15 years 6 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...