Sciweavers

2969 search results - page 84 / 594
» A space efficient algorithm for group structure computation
Sort
View
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
16 years 3 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
DAWAK
2009
Springer
15 years 1 months ago
BitCube: A Bottom-Up Cubing Engineering
Enhancing on line analytical processing through efficient cube computation plays a key role in Data Warehouse management. Hashing, grouping and mining techniques are commonly used ...
Alfredo Ferro, Rosalba Giugno, Piera Laura Puglisi...
133
Voted
ICPP
2009
IEEE
15 years 29 days ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun
125
Voted
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 3 months ago
CONCISE: Compressed 'n' Composable Integer Set
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
Alessandro Colantonio, Roberto Di Pietro
SIAMIS
2010
171views more  SIAMIS 2010»
14 years 10 months ago
Global Optimization for One-Dimensional Structure and Motion Problems
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
Olof Enqvist, Fredrik Kahl, Carl Olsson, Kalle &Ar...