13099 search results - page 2301 / 2620 » Cooperative method development |
197
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
In this paper, we propose a new way to automatically model and predict human behavior of receiving and disseminating information by analyzing the contact and content of personal c...
178
Voted
CHI
2007
ACM
16 years 7 months ago
2007
ACM
We describe the design process and initial user study of an audio game created for the visually impaired. Until the advent of 3D graphics games, platform games where the player ju...
177
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
264
Voted
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
178
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...