Sciweavers

2878 search results - page 326 / 576
» Learning the Common Structure of Data
Sort
View
SSDBM
2008
IEEE
115views Database» more  SSDBM 2008»
16 years 28 days ago
Breaking the Curse of Cardinality on Bitmap Indexes
Bitmap indexes are known to be efficient for ad-hoc range queries that are common in data warehousing and scientific applications. However, they suffer from the curse of cardina...
Kesheng Wu, Kurt Stockinger, Arie Shoshani
CONEXT
2008
ACM
15 years 8 months ago
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
Jing Fu, Jennifer Rexford
DAGSTUHL
2010
15 years 8 months ago
Towards Automatic Feature-based Visualization
Visualizations are well suited to communicate large amounts of complex data. With increasing resolution in the spatial and temporal domain simple imaging techniques meet their lim...
Heike Jänicke, Gerik Scheuermann
ISVC
2010
Springer
15 years 5 months ago
Subversion Statistics Sifter
We present Subversion Statistics Sifter, a visualisation and statistics system for exploring the structure and evolution of data contained in Subversion repositories with respect t...
Christoph Müller, Guido Reina, Michael Burch,...
FPL
2009
Springer
135views Hardware» more  FPL 2009»
15 years 11 months ago
Fast critical sections via thread scheduling for FPGA-based multithreaded processors
As FPGA-based systems including soft processors become increasingly common, we are motivated to better understand the architectural trade-offs and improve the efficiency of these...
Martin Labrecque, J. Gregory Steffan