Sciweavers

587 search results - page 92 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
ICTAC
2009
Springer
14 years 7 months ago
A First-Order Policy Language for History-Based Transaction Monitoring
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
Andreas Bauer 0002, Rajeev Goré, Alwen Tiu
99
Voted
WWW
2011
ACM
14 years 4 months ago
Mark my words!: linguistic style accommodation in social media
The psycholinguistic theory of communication accommodation accounts for the general observation that participants in conversations tend to converge to one another’s communicativ...
Cristian Danescu-Niculescu-Mizil, Michael Gamon, S...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
15 years 10 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
100
Voted
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
15 years 10 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
105
Voted
ISMAR
2006
IEEE
15 years 3 months ago
User evaluations on form factors of tangible magic lenses
Magic Lens is a small inset window embedded in a large context view, which provides an alternative view to the region of interest selected from the context view. This metaphor is ...
Ji-Young Oh, Hong Hua