|
ROLE
 Author only
AUTHOR PROFILE PAGES (BETA)
Project background
BOOKMARK & SHARE
|
|
|
|
| Export results as:
BibTeX
EndNotes
ACM Ref
|
| 2009
|
1
|
|
Competitive Analysis of Aggregate Max in Windowed Streaming
Luca Becchetti, Elias Koutsoupias
|
|
July 2009
|
|
ICALP '09: Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 0 |
 |
|
We consider the problem of maintaining a fixed number k of items observed over a data stream, so as to optimize the maximum value over a fixed number n of recent observations. Unlike previous approaches, we use the competitive analysis ...
|
| |
|
| 2008
|
2
|
|
Self-Adaptive Recommendation Systems: Models and Experimental Analysis
Luca Becchetti, Ugo Colesanti, Alberto Marchetti-Spaccamela, Andrea Vitaletti
|
|
October 2008
|
|
SASO '08: Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 0 |
|
|
We design and study recommendation algorithms for a fully decentralized scenario in which each item/node of a network recommends other items/nodes only on the basis of simple statistics on the behavior of users that visited the node in the past.We perform ...
|
| |
|
3
|
|
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Luca Becchetti, Paolo Boldi, Carlos Castillo, Aristides Gionis
|
|
August 2008
|
|
KDD '08: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
|
|
Publisher: ACM
|
|
Full text available: |
 Pdf
(298.45 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 22, Downloads (12 Months): 247, Citation Count: 2 |
|
|
In this paper we study the problem of local triangle counting in large graphs. Namely, given a large graph G = (V;E) we want to estimate as accurately as possible the number of triangles incident to every node υ ∈ V in ...
Keywords: graph mining, probabilistic algorithms, semi-streaming
|
| |
|
4
|
|
Link analysis for Web spam detection
Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo Baeza-YATES, Stefano Leonardi
|
|
February 2008
|
|
Transactions on the Web (TWEB)
, Volume 2 Issue 1
|
|
Publisher: ACM
|
|
Full text available: |
Pdf
(2.14 MB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 69, Downloads (12 Months): 515, Citation Count: 2 |
|
|
We propose link-based techniques for automatic detection of Web spam, a term referring to pages which use deceptive techniques to obtain undeservedly high scores in search engines. The use of Web spam is widespread and difficult to solve, mostly due ...
Keywords: Link analysis, adversarial information retrieval
|
| |
|
| 2007
|
5
|
|
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy
L. Becchetti, J. Könemann, S. Leonardi, M. Páal
|
|
May 2007
|
|
Transactions on Algorithms (TALG)
, Volume 3 Issue 2
|
|
Publisher: ACM
|
|
Full text available: |
Pdf
(244.67 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 4, Downloads (12 Months): 50, Citation Count: 0 |
|
|
In the multicommodity rent-or-buy (MROB) network design problems, we are given a network together with a set of k terminal pairs (s1, t1), …, (sk, tk. ...
Keywords: Approximation algorithms, Steiner forests, cost sharing, network design
|
| |
|
| 2006
|
6
|
|
A reference collection for web spam
Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, Sebastiano Vigna
|
|
December 2006
|
|
SIGIR Forum
, Volume 40 Issue 2
|
|
Publisher: ACM
|
|
Full text available: |
Pdf
(609.92 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 17, Downloads (12 Months): 134, Citation Count: 28 |
|
|
We describe the WEBSPAM-UK2006 collection, a large set of Web pages that have been manually annotated with labels indicating if the hosts are include Web spam aspects or not. This is the first publicly available Web spam collection that includes page ...
|
| |
|
7
|
|
Latency constrained aggregation in sensor networks
Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti
|
|
September 2006
|
|
ESA'06: Proceedings of the 14th conference on Annual European Symposium - Volume 14
, Volume 14
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 2 |
|
|
A sensor network consists of sensing devices which may exchange data through wireless communication; sensor networks are highly energy constrained since they are usually battery operated. Data aggregation is a possible way to save energy consumption: ...
|
| |
|
8
|
|
The distribution of pageRank follows a power-law only for particular values of the damping factor
Luca Becchetti, Carlos Castillo
|
|
May 2006
|
|
WWW '06: Proceedings of the 15th international conference on World Wide Web
|
|
Publisher: ACM
|
|
Full text available: |
Pdf
(124.07 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 8, Downloads (12 Months): 47, Citation Count: 3 |
|
|
We show that the empirical distribution of the PageRank values in a large set of Web pages does not follow a power-law except for some particular choices of the damping factor. We argue that for a graph with an in-degree distribution following a power-law ...
Keywords: pagerank distribution, web graph
|
| |
|
9
|
|
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schfer, Tjark Vredeveld
|
|
February 2006
|
|
Mathematics of Operations Research
, Volume 31 Issue 1
|
|
Publisher: INFORMS
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 1 |
|
|
In this paper, we introduce the notion of smoothed competitive analysis of online algorithms. Smoothed analysis has been proposed by Spielman and Teng [25] to explain the behavior of algorithms that work well in practice while performing very poorly ...
Keywords: average-case analysis, competitive analysis, multilevel feedback, scheduling
|
| |
|
| 2005
|
10
|
|
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy
Luca Becchetti, Jochen Könemann, Stefano Leonardi, M. Pál
|
|
January 2005
|
|
SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
|
|
Publisher: Society for Industrial and Applied Mathematics
|
|
Full text available: |
Pdf
(907.84 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 4, Downloads (12 Months): 19, Citation Count: 5 |
|
|
In the multicommodity rent-or-buy (MROB) network design problem we are given a network together with a set of k terminal pairs (s1, t1),.....,(sk, tk). The goal is ...
|
| |
|
|
|
|
|
Publisher Site