Sciweavers

2373 search results - page 62 / 475
» Complexities for generalized models of self-assembly
Sort
View
TSMC
2002
110views more  TSMC 2002»
15 years 3 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
NCA
2007
IEEE
15 years 3 months ago
Safety management of complex technology
One of the key success factors behind the human species is the ability to think, plan and pursue goals. Apart from wisdom and tacit knowledge, experience and awareness of the phys...
Ali G. Hessami
CVPR
2012
IEEE
13 years 6 months ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori
QEST
2006
IEEE
15 years 10 months ago
Bound-Preserving Composition for Markov Reward Models
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
David Daly, Peter Buchholz, William H. Sanders
CAISE
2008
Springer
15 years 6 months ago
How Much Language Is Enough? Theoretical and Practical Use of the Business Process Modeling Notation
The Business Process Modeling Notation (BPMN) is an increasingly important industry standard for the graphical representation of business processes. BPMN offers a wide range of mod...
Michael zur Muehlen, Jan Recker