Sciweavers

3378 search results - page 601 / 676
» A universe of binding and computation
Sort
View
PODC
2009
ACM
15 years 10 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
PODS
2009
ACM
136views Database» more  PODS 2009»
15 years 10 months ago
Distributed XML design
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
Serge Abiteboul, Georg Gottlob, Marco Manna
CHI
2002
ACM
15 years 10 months ago
Video browsing interfaces for the open video project
The Open Video Project is an on-going effort to develop an open source digital video collection that can be used by the research community and ultimately serve an even broader aud...
Gary Geisler, Gary Marchionini, Barbara M. Wildemu...
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
15 years 10 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
15 years 10 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...