Sciweavers

2463 search results - page 431 / 493
» Rankings of Directed Graphs
Sort
View
DIS
2006
Springer
14 years 24 days ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
ECAI
2006
Springer
14 years 24 days ago
Resolving Conflicts in Action Descriptions
Abstract. We study resolving conflicts between an action description and a set of conditions (possibly obtained from observations), in the context of action languages. In this form...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
14 years 23 days ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde
ACSC
2001
IEEE
14 years 23 days ago
Efficiency of Data Structures for Detecting Overlaps in Digital Documents
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
Krisztián Monostori, Arkady B. Zaslavsky, H...
ECAI
2000
Springer
14 years 22 days ago
Learning Efficiently with Neural Networks: A Theoretical Comparison between Structured and Flat Representations
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
Marco Gori, Paolo Frasconi, Alessandro Sperduti