Sciweavers

205 search results - page 7 / 41
» Combinatorics of sequential dynamical systems
Sort
View
HPCA
2008
IEEE
14 years 7 months ago
Uncovering hidden loop level parallelism in sequential applications
As multicore systems become the dominant mainstream computing technology, one of the most difficult challenges the industry faces is the software. Applications with large amounts ...
Hongtao Zhong, Mojtaba Mehrara, Steven A. Lieberma...
BMCBI
2008
86views more  BMCBI 2008»
13 years 7 months ago
Piecewise multivariate modelling of sequential metabolic profiling data
Background: Modelling the time-related behaviour of biological systems is essential for understanding their dynamic responses to perturbations. In metabolic profiling studies, the...
Mattias Rantalainen, Olivier Cloarec, Timothy M. D...
COCOON
1998
Springer
13 years 11 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
PDIS
1994
IEEE
13 years 11 months ago
Exposing I/O Concurrency with Informed Prefetching
Informed prefetching provides a simple mechanism for I/O-intensive, cache-ineffective applications to efficiently exploit highly-parallel I/O subsystems such as disk arrays. This ...
R. Hugo Patterson, Garth A. Gibson
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 8 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar