Sciweavers

3206 search results - page 366 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
ISPA
2005
Springer
16 years 8 days ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
SIGGRAPH
1995
ACM
15 years 10 months ago
Stochastic screening dithering with adaptive clustering
We developa clustereddithering methodthatusesstochasticscreening and is able to perform an adaptive variation of the cluster size. This makes it possible to achieve optimal rendit...
Luiz Velho, Jonas Gomes
179
Voted
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
16 years 1 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ï¬...
Marek Lipczak, Evangelos E. Milios
191
Voted
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 11 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
VLDB
2002
ACM
108views Database» more  VLDB 2002»
15 years 6 months ago
Generic Database Cost Models for Hierarchical Memory Systems
Accurate prediction of operator execution time is a prerequisite for database query optimization. Although extensively studied for conventional disk-based DBMSs, cost modeling in ...
Stefan Manegold, Peter A. Boncz, Martin L. Kersten