Sciweavers

2084 search results - page 386 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 1 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
PODS
2012
ACM
297views Database» more  PODS 2012»
13 years 3 days ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...
HPDC
2006
IEEE
15 years 3 months ago
Path Grammar Guided Trace Compression and Trace Approximation
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...
Xiaofeng Gao, Allan Snavely, Larry Carter
113
Voted
SECON
2010
IEEE
14 years 7 months ago
Back-Tracking Based Sensor Deployment by a Robot Team
Existing solutions to carrier-based sensor placement by a single robot, in a bounded unknown region of interest (ROI), do not guarantee full area coverage and/or do not terminate. ...
Greg Fletcher, Xu Li, Amiya Nayak, Ivan Stojmenovi...
CORR
2010
Springer
201views Education» more  CORR 2010»
14 years 7 months ago
Online Advertisement, Optimization and Stochastic Networks
In this paper, we propose a stochastic model to describe how search service providers charge client companies based on users' queries for the keywords related to these compan...
R. Srikant