Sciweavers

2488 search results - page 266 / 498
» A Model for the Prediction of R-tree Performance
Sort
View
ICOIN
2003
Springer
15 years 11 months ago
Information-Theoretic Bounds for Mobile Ad-hoc Networks Routing Protocols
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
Nianjun Zhou, Alhussein A. Abouzeid
PPL
2008
124views more  PPL 2008»
15 years 6 months ago
Experimental Evaluation of BSP Programming Libraries
The model of bulk-synchronous parallel computation (BSP) helps to implement portable general purpose algorithms while keeping predictable performance on different parallel compute...
Peter Krusche
SMC
2010
IEEE
139views Control Systems» more  SMC 2010»
15 years 4 months ago
Pin-pointing concept descriptions
In this study, the task of obtaining accurate and comprehensible concept descriptions of a specific set of production instances has been investigated. The suggested method, inspire...
Cecilia Sönströd, Ulf Johansson, Henrik ...
IPPS
2003
IEEE
15 years 12 months ago
ECO: An Empirical-Based Compilation and Optimization System
In this paper, we describe a compilation system that automates much of the process of performance tuning that is currently done manually by application programmers interested in h...
Nastaran Baradaran, Jacqueline Chame, Chun Chen, P...
COGSCI
2002
103views more  COGSCI 2002»
15 years 6 months ago
Perceiving temporal regularity in music
We address how listeners perceive temporal regularity in music performances, which are rich in temporal irregularities. A computational model is described in which a small system ...
Edward W. Large, Caroline Palmer