Sciweavers

2157 search results - page 167 / 432
» Optimal Fast Hashing
Sort
View
TVCG
2008
108views more  TVCG 2008»
15 years 4 months ago
Particle-based labeling: Fast point-feature labeling without obscuring other visual features
In many information visualization techniques, labels are an essential part to communicate the visualized data. To preserve the expressiveness of the visual representation, a placed...
Martin Luboschik, Heidrun Schumann, Hilko Cords
COORDINATION
2009
Springer
16 years 5 months ago
Hop, a Fast Server for the Diffuse Web
The diffuse Web is an alternative way of using the Web 2.0 infrastructure for building personal diffuse applications. Systems that let users tune the temperature of their house wit...
Manuel Serrano
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 4 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
16 years 4 months ago
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Relational XQuery systems try to re-use mature relational data management infrastructures to create fast and scalable XML database technology. This paper describes the main featur...
Peter A. Boncz, Torsten Grust, Maurice van Keulen,...
EDBT
2006
ACM
190views Database» more  EDBT 2006»
16 years 4 months ago
Fast Approximate Wavelet Tracking on Streams
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
Graham Cormode, Minos N. Garofalakis, Dimitris Sac...