3602 search results - page 57 / 721 » Isn't It About Time |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
RSA
2011
13 years 2 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Recent research has identified significant vulnerabilities in recommender systems. Shilling attacks, in which attackers introduce biased ratings in order to influence future recom...
CHI
2008
ACM
14 years 8 months ago
2008
ACM
The way we experience and evaluate interactive products develops over time. An exploratory study aimed at understanding how users form evaluative judgments during the first experi...
ICSM
2009
IEEE
14 years 2 months ago
2009
IEEE
Existing studies on the maintenance of open source projects focus primarily on the analyses of the overall maintenance of the projects and less on specific categories like the co...