Sciweavers

831 search results - page 5 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
SODA
2010
ACM
409views Algorithms» more  SODA 2010»
14 years 5 months ago
Data Structures for Range Minimum Queries in Multidimensional Arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
Hao Yuan, Mikhail J. Atallah
IJCAI
2001
13 years 9 months ago
The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding
A tight integration of Mitchell's version space algorithm with Agrawal et al.'s Apriori algorithm is presented. The algorithm can be used to generate patterns that satis...
Luc De Raedt, Stefan Kramer
CVPR
2005
IEEE
14 years 9 months ago
Optimal Sub-Shape Models by Minimum Description Length
Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowle...
Georg Langs, Philipp Peloschek, Horst Bischof
CAISE
2004
Springer
13 years 11 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
FLAIRS
2004
13 years 9 months ago
MultiDE: A Simple, Powerful Differential Evolution Algorithm for Finding Multiple Global Optima
This paper presents multiDE, an extension of Price and Storn's differential evolution (DE) algorithm that consistently outperforms state-of-the-art search techniques for iden...
Zachary V. Hendershot, Frank W. Moore