Sciweavers

12950 search results - page 25 / 2590
» On Optimal Timed Strategies
Sort
View
PODS
2001
ACM
135views Database» more  PODS 2001»
14 years 7 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 4 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
PATMOS
2007
Springer
14 years 1 months ago
Optimization for Real-Time Systems with Non-convex Power Versus Speed Models
Abstract. Until now, the great majority of research in low-power systems has assumed a convex power model. However, recently, due to the confluence of emerging technological and ar...
Ani Nahapetian, Foad Dabiri, Miodrag Potkonjak, Ma...
SC
2005
ACM
14 years 1 months ago
Performance Modeling and Tuning Strategies of Mixed Mode Collective Communications
On SMP clusters, mixed mode collective MPI communications, which use shared memory communications within SMP nodes and point-to-point communications between SMP nodes, are more e...
Meng-Shiou Wu, Ricky A. Kendall, Kyle Wright, Zhao...
P2P
2007
IEEE
107views Communications» more  P2P 2007»
14 years 1 months ago
Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies
Current P2P systems employ tit-for-tat strategies, where peers only upload when they are simultaneously downloading, to avoid free riding. We derive optimal tit-for-tat strategies...
Dimitri do B. DeFigueiredo, Balaji Venkatachalam, ...