11231 search results - page 2243 / 2247 » Digging for Data Structures |
CGO
2011
IEEE
12 years 11 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
CHI
2011
ACM
12 years 11 months ago
2011
ACM
In this paper, we explore the role that attribution plays in shaping user reactions to content reuse, or remixing, in a large user-generated content community. We present two stud...
CHI
2011
ACM
12 years 11 months ago
2011
ACM
We all spend time every day looking for information in our email, yet we know little about this refinding process. Some users expend considerable preparatory effort creating compl...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...