Sciweavers

2600 search results - page 461 / 520
» Clustering with or without the Approximation
Sort
View
EDBT
2010
ACM
170views Database» more  EDBT 2010»
13 years 11 months ago
Augmenting OLAP exploration with dynamic advanced analytics
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
Benjamin Leonhardi, Bernhard Mitschang, Rubé...
MOBISYS
2010
ACM
13 years 10 months ago
GreenGPS: a participatory sensing fuel-efficient maps application
This paper develops a navigation service, called GreenGPS, that uses participatory sensing data to map fuel consumption on city streets, allowing drivers to find the most fueleffi...
Raghu K. Ganti, Nam Pham, Hossein Ahmadi, Saurabh ...
ANCS
2008
ACM
13 years 9 months ago
Packet prediction for speculative cut-through switching
The amount of intelligent packet processing in an Ethernet switch continues to grow, in order to support of embedded applications such as network security, load balancing and qual...
Paul Congdon, Matthew Farrens, Prasant Mohapatra
ATAL
2008
Springer
13 years 9 months ago
On the importance of migration for fairness in online grid markets
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
Lior Amar, Ahuva Mu'alem, Jochen Stößer
CF
2006
ACM
13 years 9 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander