Sciweavers

2080 search results - page 5 / 416
» Measuring empirical computational complexity
Sort
View
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 10 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
TRIDENTCOM
2005
IEEE
14 years 3 months ago
TBI: End-to-End Network Performance Measurement Testbed for Empirical Bottleneck Detection
— Recent advances in networking include new bandwidth-intensive applications, sophisticated protocols that enable real-time data and multimedia delivery and aspects of network se...
Prasad Calyam, Dima Krymskiy, Mukundan Sridharan, ...
CCR
2008
101views more  CCR 2008»
13 years 10 months ago
Empirical evaluation of hash functions for multipoint measurements
A broad spectrum of network measurement applications demand passive multipoint measurements in which data from multiple observation points has to be correlated. Examples are the p...
Christian Henke, Carsten Schmoll, Tanja Zseby
IR
2002
13 years 9 months ago
An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms
Collaborative filtering systems predict a user's interest in new items based on the recommendations of other people with similar interests. Instead of performing content index...
Jonathan L. Herlocker, Joseph A. Konstan, John Rie...
HCI
2007
13 years 11 months ago
Measuring the Screen Complexity of Web Pages
An increasing, degree of rich and dynamic content and abundant links are making Web pages visually cluttered. This paper presents a numerical tool to evaluate the screen complexity...
Fong-Ling Fu, Shao-Yuan Chiu, Chiu Hung Su