Sciweavers

5183 search results - page 38 / 1037
» The Complexity of Distributions
Sort
View
CDC
2009
IEEE
166views Control Systems» more  CDC 2009»
14 years 4 days ago
Idempotent method for dynamic games and complexity reduction in min-max expansions
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
William M. McEneaney
IPPS
2000
IEEE
13 years 11 months ago
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs, such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
Wenyi Feng, Fred J. Meyer, Fabrizio Lombardi
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
13 years 9 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
IRCDL
2010
13 years 8 months ago
Interactive Visual Representations of Complex Information Structures
One of the most challenging issues in managing the large and diverse data available on the World Wide Web is the design of interactive systems to organize and represent information...
Gianpaolo D'Amico, Alberto Del Bimbo, Marco Meoni
MOMPES
2008
IEEE
14 years 1 months ago
Separation of Distributed Real-Time Embedded Concerns with Theme/UML
Model-driven engineering (MDE) addresses platform complexity issues by abstracting platformindependent models for subsequent transformation to platform-specific models. This faci...
Cormac Driver, Vinny Cahill, Siobhán Clarke