Sciweavers

736 search results - page 139 / 148
» Approximating the Number of Network Motifs
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 25 days ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
PODS
2010
ACM
215views Database» more  PODS 2010»
14 years 15 days ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
QOSA
2010
Springer
13 years 11 months ago
Validating Model-Driven Performance Predictions on Random Software Systems
Abstract. Software performance prediction methods are typically validated by taking an appropriate software system, performing both performance predictions and performance measurem...
Vlastimil Babka, Petr Tuma, Lubomír Bulej
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
13 years 8 months ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu