Sciweavers

4516 search results - page 759 / 904
» Data Structures in the Design of Interfaces
Sort
View
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
16 years 4 months ago
Scalable and near real-time burst detection from eCommerce queries
In large scale online systems like Search, eCommerce, or social network applications, user queries represent an important dimension of activities that can be used to study the imp...
Nish Parikh, Neel Sundaresan
CHI
2005
ACM
16 years 4 months ago
prefuse: a toolkit for interactive information visualization
Although information visualization (infovis) technologies have proven indispensable tools for making sense of complex data, wide-spread deployment has yet to take hold, as success...
Jeffrey Heer, Stuart K. Card, James A. Landay
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 4 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
SOSP
2007
ACM
16 years 1 months ago
Improving file system reliability with I/O shepherding
We introduce a new reliability infrastructure for file systems called I/O shepherding. I/O shepherding allows a file system developer to craft nuanced reliability policies to de...
Haryadi S. Gunawi, Vijayan Prabhakaran, Swetha Kri...
136
Voted
ACSC
2009
IEEE
15 years 11 months ago
Fast and Compact Hash Tables for Integer Keys
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
Nikolas Askitis