Sciweavers

810 search results - page 58 / 162
» Defining implicit objective functions for design problems
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 9 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ECCV
2002
Springer
14 years 11 months ago
Constrained Flows of Matrix-Valued Functions: Application to Diffusion Tensor Regularization
Nonlinear partial differential equations (PDE) are now widely used to regularize images. They allow to eliminate noise and artifacts while preserving large global features, such as...
Christophe Chefd'Hotel, David Tschumperlé, ...
APNOMS
2007
Springer
14 years 1 months ago
OMA DM Based Remote Software Debugging of Mobile Devices
The mobile devices have gained much functionality and intelligence with the growth of network technologies, the abundance of network resources, and the increase of various services...
Joon-Myung Kang, Hong-Taek Ju, Mi-Jung Choi, James...
EJASP
2010
92views more  EJASP 2010»
13 years 3 months ago
Optimized Paraunitary Filter Banks for Time-Frequency Channel Diagonalization
We adopt the concept of channel diagonalization to time-frequency signal expansions obtained by DFT filter banks. As a generalization of the frequency domain channel representatio...
Ziyang Ju, Thomas Hunziker, Dirk Dahlhaus
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
14 years 16 days ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski