Sciweavers

4524 search results - page 791 / 905
» The Complexity of Global Constraints
Sort
View
OL
2008
79views more  OL 2008»
13 years 8 months ago
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
Eissa Nematollahi, Tamás Terlaky
PRL
2006
115views more  PRL 2006»
13 years 8 months ago
A hybrid parallel projection approach to object-based image restoration
Approaches analyzing local characteristics of an image prevail in image restoration. However, they are less effective in cases of restoring images degraded by large size point spr...
Xin Fan, Hua Huang, Dequn Liang, Chun Qi
SIAMSC
2008
139views more  SIAMSC 2008»
13 years 8 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
RTS
2006
132views more  RTS 2006»
13 years 8 months ago
A framework for modular analysis and exploration of heterogeneous embedded systems
Abstract The increasing complexity of heterogeneous systems-on-chip, SoC, and distributed embedded systems makes system optimization and exploration a challenging task. Ideally, a ...
Arne Hamann, Marek Jersak, Kai Richter, Rolf Ernst
IM
2007
13 years 8 months ago
Inverted Index Support for Numeric Search
Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric ...
Marcus Fontoura, Ronny Lempel, Runping Qi, Jason Y...