Sciweavers

1150 search results - page 204 / 230
» Note from the Editor
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 8 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
MICCAI
2009
Springer
14 years 8 months ago
A Riemannian Framework for Orientation Distribution Function Computing
Compared with Diffusion Tensor Imaging (DTI), High Angular Resolution Imaging (HARDI) can better explore the complex microstructure of white matter. Orientation Distribution Functi...
Jian Cheng, Aurobrata Ghosh, Tianzi Jiang, Rachid ...
CHI
2007
ACM
14 years 8 months ago
Software or wetware?: discovering when and why people use digital prosthetic memory
Our lives are full of memorable and important moments, as well as important items of information. The last few years have seen the proliferation of digital devices intended to sup...
Steve Whittaker, Vaiva Kalnikaité
CHI
2002
ACM
14 years 8 months ago
Workshop: Creating and refining knowledges, identities, and understandings in on-line communities
This two-day workshop examines the ways that on-line communities create and refine their shared resources, including both the formal and observable artifacts (documents, chats, th...
Michael J. Muller, David R. Millen
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 8 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...