Sciweavers

8298 search results - page 1495 / 1660
» On the Complexity of Numerical Analysis
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
Can developer-module networks predict failures?
Software teams should follow a well defined goal and keep their work focused. Work fragmentation is bad for efficiency and quality. In this paper we empirically investigate the re...
Martin Pinzger, Nachiappan Nagappan, Brendan Murph...
SIGSOFT
2002
ACM
16 years 7 months ago
Composable semantics for model-based notations
We propose a unifying framework for model-based specification notations. Our framework captures the execution semantics that are common among model-based notations, and leaves the...
Jianwei Niu, Joanne M. Atlee, Nancy A. Day
WWW
2004
ACM
16 years 7 months ago
Updating pagerank with iterative aggregation
We present an algorithm for updating the PageRank vector [1]. Due to the scale of the web, Google only updates its famous PageRank vector on a monthly basis. However, the Web chan...
Amy Nicole Langville, Carl Dean Meyer
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 7 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 7 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
« Prev « First page 1495 / 1660 Last » Next »