Sciweavers

6599 search results - page 1137 / 1320
» Towards a Theory of Information
Sort
View
PODS
2006
ACM
216views Database» more  PODS 2006»
15 years 10 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
PODS
2007
ACM
196views Database» more  PODS 2007»
15 years 10 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
89
Voted
ICSE
2008
IEEE-ACM
15 years 10 months ago
Exploiting connector knowledge to efficiently disseminate highly voluminous data sets
Ever-growing amounts of data that must be distributed from data providers to consumers across the world necessitate a greater understanding of the software architectural implicati...
Chris Mattmann, David Woollard, Nenad Medvidovic
94
Voted
MOBISYS
2007
ACM
15 years 10 months ago
Radio interferometric tracking of mobile wireless nodes
Location-awareness is an important requirement for many mobile wireless applications today. When GPS is not applicable because of the required precision and/or the resource constr...
Branislav Kusy, János Sallai, György B...
MOBIHOC
2006
ACM
15 years 9 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
Pablo Soldati, Björn Johansson, Mikael Johans...
« Prev « First page 1137 / 1320 Last » Next »