Sciweavers

11394 search results - page 2276 / 2279
» Self-Organizing Data Structures
Sort
View
CHI
2011
ACM
13 years 4 days 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»
13 years 3 days 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
13 years 19 hour 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...
SAC
2011
ACM
12 years 11 months ago
Type harvesting: a practical approach to obtaining typing information in dynamic programming languages
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
Michael Haupt, Michael Perscheid, Robert Hirschfel...
« Prev « First page 2276 / 2279 Last » Next »