Sciweavers

5448 search results - page 527 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
DIS
2008
Springer
15 years 9 months ago
Unsupervised Classifier Selection Based on Two-Sample Test
We propose a well-founded method of ranking a pool of m trained classifiers by their suitability for the current input of n instances. It can be used when dynamically selecting a s...
Timo Aho, Tapio Elomaa, Jussi Kujala
TCS
2010
15 years 5 months ago
Maximum likelihood analysis of algorithms and data structures
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
Ulrich Laube, Markus E. Nebel

Publication
417views
16 years 3 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos
CLUSTER
2008
IEEE
16 years 1 months ago
Predictive models for bandwidth sharing in high performance clusters
Abstract—Using MPI as communication interface, one or several applications may introduce complex communication behaviors over the network cluster. This effect is increased when n...
Jérôme Vienne, Maxime Martinasso, Jea...
AINA
2006
IEEE
16 years 1 months ago
Performance Analysis of Network Topologies in Agent-based Open Connectivity Architecture for DSS
Performance analysis of agent network topologies helps multi-agent system developers to understand the impact of topology on system efficiency and effectiveness. Appropriate topol...
Hao Lan Zhang, Clement H. C. Leung, Gitesh K. Raik...