Sciweavers

498 search results - page 57 / 100
» Measuring the Complexity of Polygonal Objects
Sort
View
MP
2006
87views more  MP 2006»
13 years 11 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
ACAL
2009
Springer
14 years 5 months ago
Evaluation of the Effectiveness of Machine-Based Situation Assessment
The Information Fusion Panel within The Technical Cooperation Program (TTCP) is developing algorithms to perform machine-based situation assessment to assist human operators in co...
David M. Lingard, Dale A. Lambert
INTERACTION
2009
ACM
14 years 5 months ago
A binary method for fast computation of inter and intra cluster similarities for combining multiple clusterings
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...
Selim Mimaroglu, A. Murat Yagci
CEC
2005
IEEE
14 years 4 months ago
Relationships between internal and external metrics in co-evolution
Co-evolutionary algorithms (CEAs) have been applied to optimization and machine learning problems with often mediocre results. One of the causes for the unfulfilled expectations i...
Elena Popovici, Kenneth A. De Jong
CVDB
2004
ACM
14 years 4 months ago
A Multimedia Data Base Browsing System
Browsing large multimedia databases is becoming a challenging problem, due to the availability of great amounts of data and the complexity of retrieval. In this paper we propose a...
Massimiliano Albanese, Carmine Cesarano, Antonio P...