Matches in ScholarlyData for { ?s ?p ?o. }
- item-2 type ListItem.
- item-2 hasContent moses-charikar.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent kai-li.
- item-3 previous item-2.
- efficiently-evaluating-graph-constraints-in-conten creator andrei-broder.
- efficiently-evaluating-graph-constraints-in-conten creator bhaskar-ghosh.
- efficiently-evaluating-graph-constraints-in-conten creator jayavel-shanmugasundaram.
- efficiently-evaluating-graph-constraints-in-conten creator marcus-fontoura.
- efficiently-evaluating-graph-constraints-in-conten creator sergei-vassilvitskii.
- efficiently-evaluating-graph-constraints-in-conten creator shirshanka-das.
- efficiently-evaluating-graph-constraints-in-conten creator vanja-josifovski.
- efficiently-evaluating-graph-constraints-in-conten type InProceedings.
- efficiently-evaluating-graph-constraints-in-conten label "Efficiently Evaluating Graph Constraints in Content-Based Publish/Subscribe".
- efficiently-evaluating-graph-constraints-in-conten sameAs efficiently-evaluating-graph-constraints-in-conten.
- efficiently-evaluating-graph-constraints-in-conten abstract "We introduce the problem of evaluating graph constraints in content-based publish/subscribe (pub/sub) systems. This problem formulation extends traditional content-based pub/sub systems in the following manner: publishers and subscribers are connected via a (logical) directed graph G with node and edge constraints, which limits the set of valid paths between them. Such graph constraints can be used to model a Web advertising exchange (where there may be restrictions on how advertising networks can connect advertisers and publishers) and content delivery problems in social networks (where there may be restrictions on how information can be shared via the social graph). In this context, we develop efficient algorithms for evaluating graph constraints over arbitrary directed graphs G. We also present experimental results that demonstrate the effectiveness and scalability of the proposed algorithms using a realistic dataset from Yahoo!'s Web advertising exchange.".
- efficiently-evaluating-graph-constraints-in-conten hasAuthorList authorList.
- efficiently-evaluating-graph-constraints-in-conten hasTopic search-systems.
- efficiently-evaluating-graph-constraints-in-conten hasTopic World_Wide_Web.
- efficiently-evaluating-graph-constraints-in-conten isPartOf proceedings.
- efficiently-evaluating-graph-constraints-in-conten title "Efficiently Evaluating Graph Constraints in Content-Based Publish/Subscribe".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasItem item-6.
- authorList hasItem item-7.
- authorList hasLastItem item-7.
- item-1 type ListItem.
- item-1 hasContent andrei-broder.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent shirshanka-das.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent marcus-fontoura.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent bhaskar-ghosh.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent vanja-josifovski.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent jayavel-shanmugasundaram.
- item-6 next item-7.
- item-6 previous item-5.
- item-7 type ListItem.
- item-7 hasContent sergei-vassilvitskii.
- item-7 previous item-6.
- ep-sparql-a-unified-language-for-event-processing- creator darko-anicic.
- ep-sparql-a-unified-language-for-event-processing- creator nenad-stojanovic.
- ep-sparql-a-unified-language-for-event-processing- creator paul-fodor.
- ep-sparql-a-unified-language-for-event-processing- creator sebastian-rudolph.
- ep-sparql-a-unified-language-for-event-processing- type InProceedings.
- ep-sparql-a-unified-language-for-event-processing- label "EP-SPARQL: A Unified Language for Event Processing and Stream Reasoning".
- ep-sparql-a-unified-language-for-event-processing- sameAs ep-sparql-a-unified-language-for-event-processing-.
- ep-sparql-a-unified-language-for-event-processing- abstract "Streams of events appear increasingly today in various Web applications such as blogs, feeds, sensor data streams, geospatial information, on-line financial data, etc. Event Processing (EP) is concerned with timely detection of compound events within streams of simple events. State-of-the-art EP provides on-the-fly analysis of event streams, but cannot combine streams with background knowledge and cannot perform reasoning tasks. On the other hand, semantic tools can effectively handle background knowledge and perform reasoning thereon, but cannot deal with rapidly changing data provided by event streams. To bridge the gap, we propose Event Processing SPARQL (EP-SPARQL) as a new language for complex events and Stream Reasoning. We provide syntax and formal semantics of the language and devise an effective execution model for the proposed formalism. The execution model is grounded on logic programming, and features effective event processing and inferencing capabilities over temporal and static knowledge. We provide an open-source prototype implementation and present a set of tests to show the usefulness and effectiveness of our approach.".
- ep-sparql-a-unified-language-for-event-processing- hasAuthorList authorList.
- ep-sparql-a-unified-language-for-event-processing- hasTopic query-and-ontology-languages.
- ep-sparql-a-unified-language-for-event-processing- hasTopic World_Wide_Web.
- ep-sparql-a-unified-language-for-event-processing- isPartOf proceedings.
- ep-sparql-a-unified-language-for-event-processing- title "EP-SPARQL: A Unified Language for Event Processing and Stream Reasoning".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent darko-anicic.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent paul-fodor.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent sebastian-rudolph.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent nenad-stojanovic.
- item-4 previous item-3.
- estimating-sizes-of-social-networks-via-biased-sam creator edo-liberty.
- estimating-sizes-of-social-networks-via-biased-sam creator liran-katzir.
- estimating-sizes-of-social-networks-via-biased-sam creator oren-somekh.
- estimating-sizes-of-social-networks-via-biased-sam type InProceedings.
- estimating-sizes-of-social-networks-via-biased-sam label "Estimating Sizes of Social Networks via Biased Sampling".
- estimating-sizes-of-social-networks-via-biased-sam sameAs estimating-sizes-of-social-networks-via-biased-sam.
- estimating-sizes-of-social-networks-via-biased-sam abstract "Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological purposes, an independent estimate of their sizes is important. In this work, algorithms for estimating the number of users in such networks are considered. The proposed schemes are also applicable for estimating the sizes of networks sub-populations. The suggested algorithms interact with the social networks via their public APIs only, and rely on no other external information. Due to obvious traffic and privacy concerns, the number of such interactions is severely limited. We therefore focus on minimizing the number of API interactions needed for producing good size estimates. We adopt the abstraction of social networks as undirected graphs and use random node sampling. By counting the number of collisions or non-unique nodes in the sample, we produce a size estimate. Then, we show analytically that the estimate error vanishes with high probability for smaller number of samples than those required by prior-art algorithms. Moreover, although our algorithms are provably correct for any graph, they excel when applied to social network-like graphs. The proposed algorithms were evaluated on synthetic as well real social networks such as Facebook, IMDB, and DBLP. Our experiments corroborated the theoretical results, and demonstrated the effectiveness of the algorithms.".