Sciweavers

1350 search results - page 87 / 270
» Generalized Committed Choice
Sort
View
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
16 years 4 months ago
Systematic data selection to mine concept-drifting data streams
One major problem of existing methods to mine data streams is that it makes ad hoc choices to combine most recent data with some amount of old data to search the new hypothesis. T...
Wei Fan
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 4 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
CHI
2010
ACM
15 years 11 months ago
The effect of audience design on labeling, organizing, and finding shared files
In an online experiment, I apply theory from psychology and communications to find out whether group information management tasks are governed by the same communication processes...
Emilee Rader
ATAL
2007
Springer
15 years 10 months ago
Interactions between market barriers and communication networks in marketing systems
We investigate a framework where agents search for satisfying products by using referrals from other agents. Our model of a mechanism for transmitting word-of-mouth and the result...
Ian N. Durbach, Jan H. Hofmeyr
FSTTCS
2004
Springer
15 years 9 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav