Sciweavers

2446 search results - page 452 / 490
» Choiceless Polynomial Time
Sort
View
CDC
2010
IEEE
119views Control Systems» more  CDC 2010»
13 years 2 months ago
Event-triggered output feedback control of finite horizon discrete-time multi-dimensional linear processes
Event-triggered control systems are systems in which the control signal is recomputed when the plant's output signal leaves a triggering-set. There has been recent interest in...
Lichun Li, Michael Lemmon
COMGEO
2011
ACM
13 years 2 months ago
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
J. Joseph Fowler, Michael Jünger, Stephen G. ...
CORR
2011
Springer
261views Education» more  CORR 2011»
13 years 2 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 2 months ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain
JCO
2011
113views more  JCO 2011»
13 years 2 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...