Sciweavers

2001 search results - page 183 / 401
» Dynamic Materialized Views
Sort
View
SIGSOFT
2007
ACM
16 years 4 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
WWW
2006
ACM
16 years 4 months ago
Cat and mouse: content delivery tradeoffs in web access
Web pages include extraneous material that may be viewed as undesirable by a user. Increasingly many Web sites also require users to register to access either all or portions of t...
Balachander Krishnamurthy, Craig E. Wills
140
Voted
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
16 years 4 months ago
COA: finding novel patents through text analysis
In recent years, the number of patents filed by the business enterprises in the technology industry are growing rapidly, thus providing unprecedented opportunities for knowledge d...
Mohammad Al Hasan, W. Scott Spangler, Thomas D. Gr...
126
Voted
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
16 years 4 months ago
Mobile call graphs: beyond power-law and lognormal distributions
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...
Mukund Seshadri, Sridhar Machiraju, Ashwin Sridhar...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
16 years 4 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...