Sciweavers

9382 search results - page 1647 / 1877
» A Functional Model for Data Analysis
Sort
View
CHI
2009
ACM
16 years 6 months ago
Information foraging in E-voting
In this paper, we present a case study of humaninformation interaction in the online realm of politics. The case study consists of a participant observed while searching and brows...
Ravi K. Vatrapu, Scott P. Robertson
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 6 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
16 years 6 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler
POPL
2007
ACM
16 years 6 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 6 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
« Prev « First page 1647 / 1877 Last » Next »