Sciweavers

1068 search results - page 157 / 214
» On Space Bounded Server Algorithms
Sort
View
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 24 days ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
SIGMETRICS
2008
ACM
128views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Loss-aware network coding for unicast wireless sessions: design, implementation, and performance evaluation
Local network coding is growing in prominence as a technique to facilitate greater capacity utilization in multi-hop wireless networks. A specific objective of such local network ...
Shravan K. Rayanchu, Sayandeep Sen, Jianming Wu, S...
PLDI
2012
ACM
11 years 10 months ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
ECCV
2008
Springer
14 years 10 months ago
Quick Shift and Kernel Methods for Mode Seeking
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Andrea Vedaldi, Stefano Soatto
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
14 years 9 months ago
Bypass Caching: Making Scientific Databases Good Network Citizens
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitabl...
Tanu Malik, Randal C. Burns, Amitabh Chaudhary