Sciweavers

1734 search results - page 346 / 347
» What works
Sort
View
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 11 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
ACL
2012
11 years 11 months ago
Finding Bursty Topics from Microblogs
Microblogs such as Twitter reflect the general public’s reactions to major events. Bursty topics from microblogs reveal what events have attracted the most online attention. Al...
Qiming Diao, Jing Jiang, Feida Zhu, Ee-Peng Lim
ACL
2012
11 years 11 months ago
You Had Me at Hello: How Phrasing Affects Memorability
Understanding the ways in which information achieves widespread public awareness is a research question of significant interest. We consider whether, and how, the way in which th...
Cristian Danescu-Niculescu-Mizil, Justin Cheng, Jo...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 2 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 10 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao