Sciweavers

1362 search results - page 67 / 273
» Means, Correlations and Bounds
Sort
View
WCET
2003
15 years 3 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper
WINE
2010
Springer
162views Economy» more  WINE 2010»
14 years 11 months ago
Near-Strong Equilibria in Network Creation Games
We introduce a new solution concept for games, near-strong equilibrium, a variation of strong equilibrium. Previous work has shown the existence of 2-strong pure strategy equilibr...
Ola Rozenfeld, Moshe Tennenholtz
IRI
2007
IEEE
15 years 8 months ago
Adapting Ratings in Memory-Based Collaborative Filtering using Linear Regression
We show that the standard memory-based collaborative filtering rating prediction algorithm using the Pearson correlation can be improved by adapting user ratings using linear reg...
Jérôme Kunegis, Sahin Albayrak
CCS
2008
ACM
15 years 3 months ago
Location privacy of distance bounding protocols
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
Kasper Bonne Rasmussen, Srdjan Capkun
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 2 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...