Sciweavers

11784 search results - page 2353 / 2357
» Interpolation for data structures
Sort
View
CHI
2011
ACM
13 years 5 hour ago
Computers can't give credit: how automatic attribution falls short in an online remixing community
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...
Andrés Monroy-Hernández, Benjamin Ma...
CHI
2011
ACM
13 years 5 hour ago
Am I wasting my time organizing email?: a study of email refinding
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...
Steve Whittaker, Tara Matthews, Julian A. Cerruti,...
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 12 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
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...
Andrei E. Romashchenko
ICALP
2011
Springer
12 years 12 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
PVLDB
2011
12 years 11 months ago
Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
Stratos Idreos, Stefan Manegold, Harumi A. Kuno, G...
« Prev « First page 2353 / 2357 Last » Next »