Sciweavers

1172 search results - page 147 / 235
» Using Small Screen Space More Efficiently
Sort
View
134
Voted
ISCI
2008
116views more  ISCI 2008»
15 years 3 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
107
Voted
SAC
2002
ACM
15 years 3 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
155
Voted
JCDL
2006
ACM
147views Education» more  JCDL 2006»
15 years 9 months ago
The social life of books in the humane library
The development of public libraries may have inadvertently brought the age of marginalia to a close but the advent of digital libraries could revive the practice of marginal annot...
Yoram Chisik, Nancy Kaplan
100
Voted
ICSE
2010
IEEE-ACM
15 years 5 months ago
Quality of service profiling
Many computations exhibit a trade off between execution time and quality of service. A video encoder, for example, can often encode frames more quickly if it is given the freedom ...
Sasa Misailovic, Stelios Sidiroglou, Henry Hoffman...
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 11 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled