Sciweavers

4488 search results - page 549 / 898
» Properties of NP-Complete Sets
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 7 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye
ECCC
2010
103views more  ECCC 2010»
15 years 7 months ago
Pseudorandom Generators for Regular Branching Programs
We give new pseudorandom generators for regular read-once branching programs of small width. A branching program is regular if the in-degree of every vertex in it is either 0 or 2...
Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff
AUTOMATICA
2006
106views more  AUTOMATICA 2006»
15 years 7 months ago
Decentralized receding horizon control for large scale dynamically decoupled systems
A detailed study on the design of decentralized Receding Horizon Control (RHC) schemes for decoupled systems is presented. An optimal control problem is formulated for a set of de...
Tamás Keviczky, Francesco Borrelli, Gary J....
CGF
2006
155views more  CGF 2006»
15 years 7 months ago
Opacity Peeling for Direct Volume Rendering
The most important technique to visualize 3D scalar data, as they arise e.g. in medicine from tomographic measurement, is direct volume rendering. A transfer function maps the sca...
Christof Rezk-Salama, Andreas Kolb
CORR
2006
Springer
150views Education» more  CORR 2006»
15 years 7 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...