Sciweavers

820 search results - page 8 / 164
» Finding low-utility data structures
Sort
View
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 8 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
CF
2006
ACM
13 years 10 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
BIBE
2007
IEEE
195views Bioinformatics» more  BIBE 2007»
14 years 3 months ago
Finding Clusters of Positive and Negative Coregulated Genes in Gene Expression Data
— In this paper, we propose a system for finding partial positive and negative coregulated gene clusters in microarray data. Genes are clustered together if they show the same p...
Kerstin Koch, Stefan Schönauer, Ivy Jansen, J...
ICRA
2003
IEEE
129views Robotics» more  ICRA 2003»
14 years 1 months ago
Optimal navigation and object finding without geometric maps or localization
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
Benjamín Tovar, Steven M. LaValle, Rafael M...
WAW
2010
Springer
306views Algorithms» more  WAW 2010»
13 years 6 months ago
Finding and Visualizing Graph Clusters Using PageRank Optimization
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
Fan Chung Graham, Alexander Tsiatas