2080 search results - page 84 / 416 » Measuring empirical computational complexity |
SODA
2000
ACM
14 years 14 days ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
EUROPAR
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. To analyze the correctness and the performance of a program, information about the dynamic behavior of all participating processes is needed. The dynamic behavior can be ...
GECCO
2005
Springer
14 years 4 months ago
2005
Springer
For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy –...
WSC
2008
14 years 1 months ago
2008
Recent research has shown that while many complex networks follow a power-law distribution for their node degrees, it is not sufficient to model these networks based only on their...
ICDM
2008
IEEE
14 years 5 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...