86 search results - page 8 / 18 » On the complexity of optimization over the standard simplex |
117
click to vote
ACCV
2009
Springer
15 years 6 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
HYBRID
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we present an automatable decompositional method for the computation of Lyapunov functions for hybrid systems with complex discrete state spaces. We use graph-based ...
BDA
2007
15 years 1 months ago
2007
We present Pattern-by-Example (PBE), a graphical language that allows users with little or no knowledge of pattern-matching and functional programming to define complex and optim...
117
click to vote
CP
2008
Springer
15 years 1 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
PVLDB
2008
14 years 11 months ago
2008
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...