Sciweavers

2321 search results - page 379 / 465
» Optimizing WebPage Interest
Sort
View
120
Voted
SPAA
2009
ACM
16 years 3 months ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa
120
Voted
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
16 years 2 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
16 years 2 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 12 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
168
Voted
ALT
2009
Springer
15 years 11 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes