4850 search results - page 693 / 970 » Approximate Data Structures with Applications |
157
click to vote
VLDB
1999
ACM
15 years 9 months ago
1999
ACM
On-Line Analytical Processing (OLAP) based on a dimensional view of data is being used increasingly for the purpose of analyzing very large amounts of data. To improve query perfo...
134
click to vote
ECHT
1992
15 years 9 months ago
1992
This paper discusses experiences and lessons learned from the design of an open hypermedia system, one that integrates applications and data not "owned" by the hypermedi...
142
click to vote
SWAT
1992
Springer
15 years 9 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
160
click to vote
CIKM
2008
Springer
15 years 7 months ago
2008
Springer
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
143
click to vote
SDM
2010
SIAM
15 years 6 months ago
2010
SIAM
We introduce a novel Bayesian framework for hybrid community discovery in graphs. Our framework, HCDF (short for Hybrid Community Discovery Framework), can effectively incorporate...