@base . @prefix rdf: . ; "WWW2011" ; ; , ; , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ; a ; "20th International World Wide Web Conference" ; ; ; . ; , ; , , ; "A Demo Search Engine for Products" ; ; "Most product search engines today build on models of relevance devised for information retrieval. However, the decision mechanism that underlies the process of buying a product is different than the process of locating relevant documents or objects. We propose a theory model for product search based on expected utility theory from economics. Specifically, we propose a ranking technique in which we rank highest the products that generate the highest surplus, after the purchase. We instantiate our research by building a demo search engine for hotels that takes into account consumer heterogeneous preferences, and also accounts for the varying hotel price. Moreover, we achieve this without explicitly asking the preferences or purchasing histories of individual consumers but by using aggregate demand data. This new ranking system is able to recommend consumers products with ``best value for money'' in a privacy-preserving manner. The demo is accessible at http://nyuhotels.appspot.com/" ; , , ; "March/April" ; "233" ; ; "2011" ; a ; "A Demo Search Engine for Products" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , ; , ; "A Tool for Fast Indexing and Querying of Graphs" ; ; "We present a tool called GiS for indexing and querying a large database of labeled, undirected graphs. Such graphs can model chemical compounds, represent contact maps constructed from 3D structure of proteins, and so forth. GiS supports exact subgraph matching and approximate graph matching queries. It adopts a suite of new techniques and algorithms for (a) fast construction of disk-based indexes with small index sizes, and (b) efficient query processing with high precision of matching. During the demo, the user can index real graph datasets using a recommendation facility in GiS, pose exact subgraph matching and approximate graph matching queries, and view matching graphs using the Jmol browser." ; , ; "March/April" ; "241" ; ; "2011" ; a ; "A Tool for Fast Indexing and Querying of Graphs" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , ; , ; "A User-Tunable Approach to Marketplace Search" ; ; "The notion of relevance is key to the performance of search engines as they interpret the user queries and respond with matching results. Online search engines have used other features beyond pure IR features to return relevant matching documents. However, over-emphasis on relevance could lead to redundancy in search results. In document search, diversity is simply the variety of documents that span the result set. In an online marketplace the diversity in the result set is represented by items for sale by different sellers at different prices with different sales options. For such a marketplace, in order to minimize query abandonment and the risk of dissatisfaction to the average user, several factors like diversity, trust and value need to be taken into account. Previous work in this field [4] has shown an impossibility result that there exists no such function that can optimize for all these factors. Since these factors and the measures associated with the factors could be subjective we take an approach of giving the control back to the user. In this paper we describe an interface which enables users to have more control over the optimization function used to present the results. We demonstrate this for search on eBay - one of the largest online marketplaces with a vibrant user community and dynamic inventory. We use an algorithm based on bounded greedy selection [5] to construct the result set based on parameters specified by the user." ; , ; "March/April" ; "245" ; ; "2011" ; a ; "A User-Tunable Approach to Marketplace Search" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , ; , , , , , ; "Accelerating Instant Question Search with Database Techniques" ; ; "Distributed question answering services, like Yahoo Answer and Aardvark, are known to be useful for end users and have also opened up numerous topics ranging in many research fields. In this paper, we propose a user-support tool for composing questions in such services. Our system incrementally recommends similar questions while users are typing their question in a sentence, which gives the users opportunities to know that there are similar questions that have already been solved. A question database is semantically analyzed and searched in the semantic space by boosting the performance of similarity searches with database techniques such as server/client caching and LSH (Locality Sensitive Hashing). The more text the user enters, the more similar the recommendations will become to the ultimately desired question. This unconscious editing-as-a-sequence-of-searches approach helps users to form their question incrementally through interactive supplementary information. Not only askers nor repliers, but also service providers have advantages such as that the knowledge of the service will be autonomously refined by avoiding for novice users to repeat questions which have been already solved." ; , , , , , ; "March/April" ; "205" ; ; "2011" ; a ; "Accelerating Instant Question Search with Database Techniques" ; , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; , ; , , , ; "Adapting a Map Query Interface for a Gesturing Touch Screen Interface" ; ; "NewsStand is an example application of a general framework that we are developing to enable searching for information using a map query interface, where the information results from monitoring the output of over 8,000 RSS news sources and is available for retrieval within minutes of publication. The user interface of NewsStand was recently adapted so that NewsStand can execute on mobile and tablet devices with a gesturing touch screen interface such as the iPhone, iPod Touch, and iPad. This action led to a discovery of some shortcomings of current mapping APIs as well as devising some interesting new widgets. These issues are discussed, and the realization can be seen by a demo at http://newsstand.umiacs.umd.edu on any of the above Apple devices as well as other devices that support gestures such as an Android phone." ; , , , ; "March/April" ; "257" ; ; "2011" ; a ; "Adapting a Map Query Interface for a Gesturing Touch Screen Interface" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , ; , , , , ; "Automatically Building Probabilistic Databases from the Web" ; ; "A relevant number of web sites publish structured data about recognizable concepts (such as stock quotes, movies, restau- rants, etc.). There is a great chance to create applications that rely on a huge amount of data taken from the Web. We present an automatic and domain independent system that performs all the steps required to benefit from these data: it discovers data intensive web sites containing information about an entity of interest, extracts and integrate the published data, and finally performs a probabilistic analysis to characterize the impreciseness of the data and the accuracy of the sources. The results of the processing can be used to populate a probabilistic database." ; , , , , ; "March/April" ; "185" ; ; "2011" ; a ; "Automatically Building Probabilistic Databases from the Web" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , ; , , , , , , ; "Blognoon: Exploring a Topic in the Blogosphere" ; ; "We demonstrate Blognoon, a semantic blog search engine with the focus on topic exploration and navigation. Blognoon provides concept search instead of traditional keywords search and improves ranking by identifying main topics of posts. It enhances navigation over the Blogosphere with faceted interfaces and recommendations." ; , , , , , , ; "March/April" ; "213" ; ; "2011" ; a ; "Blognoon: Exploring a Topic in the Blogosphere" ; , , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; rdf:_7 ; a rdf:Seq . ; , ; , , , ; "CATE: Context-Aware Timeline for Entity Illustration" ; ; "Wikipedia has become one of the most authoritative information sources on the Web. Each article in Wikipedia provides a portrait of a certain entity. However, such a portrait is far from complete. An informative portrait of an entity should also reveal the context the entity belongs to. For example, for a person, major historical, political and cultural events that coincide with her life are important and should be included in that person s portrait. Similarly, the person s interactions with other people are also important. All this information should be summarized and presented in an appealing and interactive visual interface that enables users to quickly scan the entity s portrait. We demonstrate CATE which is a system that utilizes Wikipedia to create a portrait of a given entity of interest. We provide a visualization tool that summarizes the important events related to the entity . The novelty of our approach lies in seeing the portrait of an entity in a broader context, synchronous with its time." ; , , , ; "March/April" ; "269" ; ; "2011" ; a ; "CATE: Context-Aware Timeline for Entity Illustration" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , ; , ; "CONQUER: A System for Efficient Context-Aware Query Suggestions" ; ; "Many of today's search engines provide autocompletion while the user is typing a query string. This type of dynamic query suggestion can help users to formulate queries that better represent their search intent during Web search interactions. In this paper, we demonstrate our query suggestion system called CONQUER, which allows to efficiently suggest queries for a given partial query and a number of available query context observations. The context-awareness allows for suggesting queries tailored to a given context, e.g., the user location or the time of day. CONQUER uses a suggestion model that is based on the combined probabilities of sequential query patterns and context observations. For this, the weight of a context in a query suggestion can be adjusted online, for example, based on the learned user behavior or user profiles. We demonstrate the functionality of CONQUER based on 6 million queries from an AOL query log using the time of day and the country domain of the clicked URLs in the search result as context observations." ; , ; "March/April" ; "265" ; ; "2011" ; a ; "CONQUER: A System for Efficient Context-Aware Query Suggestions" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , ; , , ; "CoSi: Context-Sensitive Keyword Query Interpretation on RDF Databases" ; ; "The demo will present CoSi, a system that enables context-sensitive interpretation of keyword queries on RDF databases. The techniques for representing, managing and exploiting query history are central to achieving this objective. The demonstration will show the effectiveness of our approach for capturing a user's querying context from their query history. Further, it will show how context is utilized to influence the interpretation of a new query. The demonstration is based on DBPedia, the RDF representation of Wikipedia." ; , , ; "March/April" ; "209" ; ; "2011" ; a ; "CoSi: Context-Sensitive Keyword Query Interpretation on RDF Databases" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , ; , , , ; "DIDO: A Disease-Determinants Ontology from Web Sources" ; ; "This paper introduces DIDO, a system providing convenient access to knowledge about factors involved in human diseases, automatically extracted from textual Web sources. The knowledge base is bootstrapped by integrating entities from hand-crafted sources like MeSH and OMIM. As these are short on relationships between dierent types of biomedical entities, DIDO employs exible and robust pattern learning and constraint-based reasoning methods to automatically extract new relational facts from textual sources. These facts can then be iteratively added to the knowledge base. The result is a semantic graph of typed entities and relations between diseases, their symptoms, and their factors, with emphasis on environmental factors but covering also molecular determinants. We demonstrate the value of DIDO for knowledge discovery about causal factors and properties of complex diseases, including factor-disease chains." ; , , , ; "March/April" ; "237" ; ; "2011" ; a ; "DIDO: A Disease-Determinants Ontology from Web Sources" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , ; , , ; "Einstein: Physicist or Vegetarian? Summarizing Semantic Type Graphs for Knowledge Discovery" ; ; "The Web and, in particular, knowledge-sharing communities such as Wikipedia contain a huge amount of information encompassing disparate and diverse fields. Knowledge bases such as DBpedia or Yago represent the data in a concise and more structured way bearing the potential of bringing database tools to Web Search. The wealth of data, however, poses the challenge of how to retrieve important and valuable information, which is often intertwined with trivial and less important details. This calls for an efficient and automatic summarization method. In this demonstration proposal, we consider the novel problem of summarizing the information related to a given entity, like a person or an organization. To this end, we utilize the rich type graph that knowledge bases provide for each entity, and define the problem of selecting the best cost-restricted subset of types as summary with good coverage of salient properties. We propose a demonstration of our system which allows the user to specify the entity to summarize, an upper bound on the cost of the resulting summary, as well as to browse the knowledge base in a more simple and intuitive manner." ; , , ; "March/April" ; "273" ; ; "2011" ; a ; "Einstein: Physicist or Vegetarian? Summarizing Semantic Type Graphs for Knowledge Discovery" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , ; , , ; "Embedding MindMap as a Service for User-Driven Composition of Web Applications" ; ; "The World Wide Web is evolving towards a very large distributed platform allowing ubiquitous access to a wide range of Web applications with minimal delay and no installation required. Such Web applications range from having users undertake simple tasks, such as filling a form, to more complex tasks including collaborative work, project management, and more generally, creating, consulting, annotating, and sharing Web content. However, users are lacking a simple but yet powerful mechanism to compose Web applications, similarly to what desktop environments allowed for decades using the file explorer paradigm and the desktop metaphor. Attempts have been made to adapt the desktop metaphor to the Web environment giving birth to Webtops (Web desktops). It essentially consisted of embedding a desktop environment in a Web browser and provide access to various Web applications within the same User Interface. However, those attempts did not take into consideration to the radical differences between Web and desktop environments and applications. In this work, we introduce a new approach for Web application composition based on the mindmap metaphor. It allows browsing artifacts (Web resources) and enabling user-driven composition of their associated Web applications. Essentially, a mindmap is a graph of widgets representing artifacts created or used by Web applications and allow to list and launch all possible Web applications associated to each artifact. A tool has been developed to experiment the new metaphor and is provided as a service to be embedded in Web applications via a Web browser's plug-in. We demonstrate in this paper three case studies regarding the DBLP Web site, Wikipedia and Google Picasa Web applications." ; , , ; "March/April" ; "221" ; ; "2011" ; a ; "Embedding MindMap as a Service for User-Driven Composition of Web Applications" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , ; , , , , ; "Exploratory Search in Multi-Domain Information Spaces with Liquid Query" ; ; "Search Computing (SeCo) aims at building search applications that bridge the gap between general-purpose and vertical search engines. SeCo queries extract ranked information about several interconnected domains, such as hotels , restaurants or concerts , by interacting with Web data sources which are wrapped as search services; an example of query is: \"Find a good Jazz concert close to the user's current location, together with close-by good restaurants and hotels\". The SeCo system supports the deployment of search applications, by providing a generic software architecture and the tools for service and query registration, for query formulation and execution, and for result browsing. In this demo paper, we focus on the Liquid Query (LQ) interface which supports the iteration over query formulation, result visualization and query refinement, with commands for perusing the result set, changing the visualization of data based on their type (e.g., geographical or temporal) and interacting with the remote search services. It also supports an exploratory search approach, where the user starts by accessing one data source (e.g., an event listing for finding interesting concerts), then is assisted in progressively joining other correlated sources in an interactive exploration of the search space. The exploration paths can be chosen on the fly and the navigation history can be browsed back and forth for cross-checking the retrieved options." ; , , , , ; "March/April" ; "189" ; ; "2011" ; a ; "Exploratory Search in Multi-Domain Information Spaces with Liquid Query" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , ; , ; "Factal: Integrating Deep Web Based on Trust and Relevance" ; ; "We demonstrate \"Factal\"---a system for integrating deep web sources. Factal is based on the recently introduced source selection method \"SourceRank\"; which is a measure of trust and relevance based on the agreement between the sources. SourceRank selects popular and trustworthy sources from autonomous and open collections like the deep web. This trust and popularity awareness distinguishes Factal from the existing systems like Google Product Search. Factal selects and searches active online databases on multiple domains. The demonstration scenarios include improved trustworthiness, relevance of results, and comparison shopping. We believe that by incorporating effective source selection based on the SourceRank, Factal demonstrates a significant step towards a deep-web-scale integration system." ; , ; "March/April" ; "181" ; ; "2011" ; a ; "Factal: Integrating Deep Web Based on Trust and Relevance" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , ; , , ; "Filtering Microblogging Messages for Social TV" ; ; "Social TV was named one of the ten most important emerging technologies in 2010 by the MIT Technology Review. Manufacturers of set-top boxes and televisions have recently started to integrate access to social networks into their products. Some of these systems allow users to read microblogging messages related to the TV program they are currently watching. However, such systems suffer from low precision and recall when they use the title of the show as keywords when retrieving messages, without any additional filtering. We propose a bootstrapping approach to collecting microblogging messages related to a given TV program. We start with a small set of annotated data, in which, for a given show and a candidate message, we annotate the pair to be relevant or irrelevant. From this annotated data set, we train an initial classifier. The features are designed to capture the association between the TV program and the message. Using our initial classifier and a large dataset of unlabeled messages we derive broader features for a second classifier to further improve precision." ; , , ; "March/April" ; "197" ; ; "2011" ; a ; "Filtering Microblogging Messages for Social TV" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , ; , , , , , ; "Helix: Online Enterprise Data Analytics" ; ; "The size, heterogeneity and dynamicity of data within an enterprise makes indexing, integration and analysis of the data increasingly difficult tasks. On the other hand, there has been a massive increase in the amount of high-quality open data available on the Web that could provide invaluable insights to data analysts and business intelligence specialists within the enterprise. The goal of Helix project is to provide users within the enterprise with a platform that allows them to perform online analysis of almost any type and amount of internal data using the power of external knowledge bases available on the Web. Such a platform requires a novel, data-format agnostic indexing mechanism, and light-weight data linking techniques that could link semantically related records across internal and external data sources of various characteristics. We present the initial architecture of our system and discuss several research challenges involved in building such a system." ; , , , , , ; "March/April" ; "225" ; ; "2011" ; a ; "Helix: Online Enterprise Data Analytics" ; , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; , ; , , , , , , , ; "LivePulse: Tapping Social Media for Sentiments in Real-Time" ; ; "The rise of Twitter, blogs, review sites and social sites has motivated people to express their opinions publicly and more frequently than ever before. This has fueled the emerging field known as sentiment analysis whose goal is to translate the vagaries of human emotion into hard data. LivePulse is a tool that taps into the growing business interest in what is being said online with the particular characteristic of doing so in real-time. LivePulse integrates novel algorithms for sentiment analysis and a configurable dashboard with different kinds of dynamic charts that change as new data is ingested. It also provides support to drill down and visually explore the sentiment scores to understand how they were computed and what are the emotions expressed about a given aspect or topic. Our tool has been researched and prototyped at HP Labs in close interaction with internal and external customers whose valuable feedback has been crucial for improving the tool. This paper presents an overview of LivePulse s architecture and functionality, and illustrates how it would be demoed." ; , , , , , , , ; "March/April" ; "193" ; ; "2011" ; a ; "LivePulse: Tapping Social Media for Sentiments in Real-Time" ; , , , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; rdf:_7 ; rdf:_8 ; a rdf:Seq . ; , ; , , , ; "OntoTrix: A Hybrid Visualization for Populated Ontologies" ; ; "Most Semantic Web data visualization tools structure the representation according to the concept definitions and interrelations that constitute the ontology's vocabulary. Instances are often treated as somewhat peripheral information, when considered at all. These instances, that populate ontologies, represent an essential part of any knowledge base, and are often orders of magnitude more numerous than the concept definitions that give them machine-processable meaning. We present a visualization technique designed to enable users to visualize large instance sets and the relations that connect them. This hybrid visualization uses both node-link and adjacency matrix representations of graphs to visualize different parts of the data depending on their semantic and local structural properties, exploiting ontological knowledge to drive the graph layout. The representation is embedded in an environment that features advanced interaction techniques for easy navigation, including support for smooth continuous zooming and coordinated views." ; , , , ; "March/April" ; "177" ; ; "2011" ; a ; "OntoTrix: A Hybrid Visualization for Populated Ontologies" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , ; , , , , ; "OXPath: Little Language, Little Memory, Great Value" ; ; "Data about everything is readily available on the web-but often only accessible through elaborate user interactions. For automated decision support, extracting that data is essential, but infeasible with existing heavy-weight data extraction systems. In this demonstration, we present OXPath, a novel approach to web extraction, with a system that supports informed job selection and integrates information from several different web sites. By carefully extending XPath, OXPath exploits its familiarity and provides a light-weight interface, which is easy to use and embed. We highlight how OXPath guarantees optimal page buffering, storing only a constant number of pages for non-recursive queries." ; , , , , ; "March/April" ; "261" ; ; "2011" ; a ; "OXPath: Little Language, Little Memory, Great Value" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , ; , , ; "T-RecS: Team Recommendation System Through Expertise and Cohesiveness" ; ; "Searching for people by exploration of social networks structure is an interesting problem which has recently gathered a lot of attention. Expert recommendation is an important but also extensively researched problem. In contrast, the generalized problem of team recommendation has not been studied a lot. The purpose of this demo is to show a multidisciplinary team search and recommendation prototype. While the current demo uses specific (NTU academic) data-set, the framework is generic, and can be extended for other domains subject to availability of suitable information." ; , , ; "March/April" ; "201" ; ; "2011" ; a ; "T-RecS: Team Recommendation System Through Expertise and Cohesiveness" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , ; , , , , , , ; "Truthy: Mapping the Spread of Astroturf in Microblog Streams" ; ; "Online social media are complementing and in some cases replacing person-to-person social interaction and redefining the diffusion of information. In particular, microblogs have become crucial grounds on which public relations, marketing, and political battles are fought. We demonstrate a web service that tracks political memes in Twitter and helps detect astroturfing, smear campaigns, and other misinformation in the context of U.S. political elections. We also present some cases of abusive behaviors uncovered by our service. Our web service is based on an extensible framework that will enable the real-time analysis of meme diffusion in social media by mining, visualizing, mapping, classifying, and modeling massive streams of public microblogging events." ; , , , , , , ; "March/April" ; "249" ; ; "2011" ; a ; "Truthy: Mapping the Spread of Astroturf in Microblog Streams" ; , , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; rdf:_7 ; a rdf:Seq . ; , ; , , ; "Visual Query System for Analyzing Social Semantic Web" ; ; "The social web is becoming increasingly popular and important, because it creates the collective intelligence, which can produce more value than the sum of individuals. The social web uses the Semantic Web technology RDF to describe the social data in a machine-readable way. RDF query languages play certainly an important role in the social data analysis for extracting the collective intelligence. However, constructing such queries is not trivial since the social data is often quite large and assembled from a large number of different sources. In order to solve these challenges, we develop a Visual Query System (VQS) for helping the analysts of social data and other semantic data to formulate such queries easily and exactly. In this VQS, we suggest a condensed data view, a browser-like query creation system for absolute beginners and a Visual Query Language (VQL) for beginners and experienced users. Using the browser-like query creation or the VQL, the analysts of social data and other semantic data can construct queries with no or little syntax knowledge; using the condensed view, they can determine easily what queries should to be used. Furthermore, our system also supports precise suggestions to extend and refine existing queries." ; , , ; "March/April" ; "217" ; ; "2011" ; a ; "Visual Query System for Analyzing Social Semantic Web" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , ; , , , , ; "VoiSTV: Voice-Enabled Social TV" ; ; "Until recently, the TV viewing experience has not been a very social activity compared to activities on the World Wide Web. In this work, we will present a Voice-enabled Social TV system (VoiSTV) which allows users to interact, follow and monitor the online social media messages related to a TV show while watching it. Users can create, send, and reply to messages using spoken language. VoiSTV also provides metadata information about TV shows such as trends, hot topics, popularity as well as aggregated sentiment of show-related messages, all of which are valuable for TV program search and recommendation." ; , , , , ; "March/April" ; "253" ; ; "2011" ; a ; "VoiSTV: Voice-Enabled Social TV" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , ; , , , , , ; "YAGO2: Exploring and Querying World Knowledge in Time, Space, Context, and Many Languages" ; ; "We present YAGO2, an extension of the YAGO knowledge base with focus on temporal and spatial knowledge. It is automatically built from Wikipedia, GeoNames, and WordNet, and contains nearly 10 million entities and events, as well as 80 million facts representing general world knowledge. An enhanced data representation introduces time and location as first-class citizens. The wealth of spatio-temporal information in YAGO can be explored either graphically or through a special time- and space-aware query language." ; , , , , , ; "March/April" ; "229" ; ; "2011" ; a ; "YAGO2: Exploring and Querying World Knowledge in Time, Space, Context, and Many Languages" ; , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; ; , , , ; "Analyzing and Accelerating Web Access in a School in Peri-Urban India" ; ; "While computers and Internet access have growing penetration amongst schools in the developing world, intermittent connectivity and limited bandwidth often prevent them from being fully utilized by students and teachers. In this paper, we make two contributions to help address this problem. First, we characterize six weeks of HTTP traffic from a primary school outside of Bangalore, India, illuminating opportunities and constraints for improving performance in such settings. Second, we deploy an aggressive caching and prefetching engine and show that it accelerates a user s overall browsing experience (apart from video content) by 2.8x. Our accelerator leverages innovative techniques that have been proposed, but not evaluated in detail, including the effectiveness of serving stale pages, cached page highlighting, and client-side prefetching. Unlike proxy-based techniques, our system is bundled as an open-source Firefox plugin and runs directly on client machines. This allows easy installation and configuration by end users, which is especially important in developing regions where a lack of permissions or technical expertise often prevents modification of internal network settings." ; , , , ; "March/April" ; "443" ; ; "2011" ; a ; "Analyzing and Accelerating Web Access in a School in Peri-Urban India" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , ; "Assistive Technology for vision-impairments: An agenda for the ICT4D community" ; ; "In recent years, ICTD (Information Communications Technology and Development) has grown in significance as an area of engineering research that has focused on low-cost appropriate technologies for the needs of a developing world largely underserved by the dominant modes of technology design. Assistive Technologies (AT) used by people with disabilities facilitate greater equity in the social and economic public sphere. However, by and large such technologies are designed in the industrialized world, for people living in those countries. This is especially true in the case of AT for people with vision impairments market-prevalent technologies are both very expensive and are built to support the language and infrastructure typical in the industrialized world. While the community of researchers in the Web Accessibility space have made significant strides, the operational concerns of networks in the developing world, as well as challenges in support for new languages and contexts raises a new set of challenges for technologists in this space. We discuss the state of various technologies in the context of the developing world and propose directions in scientific and community-contributed efforts to increase the relevance and access to AT and accessibility in the developing world." ; , , , ; "March/April" ; "513" ; ; "2011" ; a ; "Assistive Technology for vision-impairments: An agenda for the ICT4D community" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , ; "Design and Implementation of Contextual Information Portals" ; ; "This paper presents a system for enabling offline web use to satisfy the information needs of disconnected communities. We describe the design, implementation, evaluation, and pilot deployment of an automated mechanism to construct Contextual Information Portals (CIPs). CIPs are large searchable information repositories of web pages tailored to the information needs of a target population. We combine an efficient classifier with a focused crawler to gather the web pages for the portal for any given topic. Given a set of topics of interest, our system constructs a CIP containing the most relevant pages from the web across these topics. Using several secondary school course syllabi, we demonstrate the effectiveness of our system for constructing CIPs for use as an education resource. We evaluate our system across several metrics: classification accuracy, crawl scalability, crawl accuracy and harvest rate. We describe the utility and usability of our system based on a preliminary deployment study at an after-school program in India, and also outline our ongoing larger-scale pilot deployment at five schools in Kenya." ; , , , ; "March/April" ; "453" ; ; "2011" ; a ; "Design and Implementation of Contextual Information Portals" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , ; "Identifying Enrichment Candidates in Textbooks" ; ; "Many textbooks written in emerging countries lack clear and adequate coverage of important concepts. We propose a technological solution for algorithmically identifying those sections of a book that are not well written and could benefit from better exposition. We provide a decision model based on the syntactic complexity of writing and the dispersion of key concepts. The model parameters are learned using a tune set which is algorithmically generated using a versioned authoritative web resource as a proxy. We evaluate the proposed methodology over a corpus of Indian textbooks which demonstrates its effectiveness in identifying enrichment candidates." ; , , , ; "March/April" ; "483" ; ; "2011" ; a ; "Identifying Enrichment Candidates in Textbooks" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , ; "Location Specific Summarization of Climatic and Agricultural Trends" ; ; "Climate change can directly impact agriculture. Failure in different aspects of agriculture due to climate change and other influencing factors, are extremely rampant in several agrarian economies, most of which go unnoticed. In this paper, we describe the design of a system that mines disparate information sources on the Web to automatically summarize important climatic and agricultural trends for any specific location and construct a location-specific climatic and agricultural information portal. We have evaluated the system across 605 different districts in India. The results revealed a pan-India scenario of different problem affected areas. The key findings from this work include, around 64.58% of the districts of India suffer from soil related issues and 76.02% have water related problems. We have also manually validated the authenticity of our information sources and validated our summarized results for specific locations with findings in reputed journals and authoritative sources." ; , ; "March/April" ; "463" ; ; "2011" ; a ; "Location Specific Summarization of Climatic and Agricultural Trends" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , ; "Low-Infrastructure Methods to Improve Internet Access for Mobile Users in Emerging Regions" ; ; "As information technology supports more aspects of modern life, digital access has become an important tool for developing regions to lift themselves from poverty. Though broadband internet connectivity will not be universally available in the short-term, widely-employed mobile devices coupled with novel delay-tolerant networking do allow limited forms of connectivity. This paper explores the design space for internet access systems operating with constrained connectivity. Our starting point is C-LINK, a collaborative caching system that enhances the performance of interactive web access over DTN and cellular connectivity. We discuss our experiences and results from deploying C-LINK in Nicaragua, before moving on to a broader design study of other issues that further influence operation. We consider the impact of (i) storing web content collaboratively cached across all user nodes, (ii) hybrid transport layers exploiting the best attributes of limited cellular and DTN-style connectivity. We also explore the behavior of future systems under a range of usage and mobility scenarios. Even under adverse conditions, our techniques can improve average service latency for page requests by a factor of 2X. Our results point to the considerable power of leveraging user mobility and collaboration in providing very-low-infrastructure internet access to developing regions." ; , ; "March/April" ; "473" ; ; "2011" ; a ; "Low-Infrastructure Methods to Improve Internet Access for Mobile Users in Emerging Regions" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , ; "The Lwazi Community Communication Service: Design and Piloting of a Voice-Based Information Service" ; ; "We present the design, development and pilot process of the Lwazi Community Communication Service (LCCS), a multilingual automated telephone-based information service. The service acts as a communication and dissemination tool that enables managers at local community centres to broadcast information (e.g. health, employment, social grants) to community workers and the communities they serve. The LCCS allows the recipients to obtain up-to-date, relevant information in a timely and efficient manner, overcoming the obstacles of transportation, time and costs incurred in trying to physically obtain information from the community centres. We discuss our experiences and fieldwork in piloting the LCCS at six locations nationally in the eleven official South African languages. We analyze the usage pattern from the pilot call logs and thereafter discuss the implications of these findings for future projects that design similar automated services for serving rural communities in developing world regions." ; , ; "March/April" ; "433" ; ; "2011" ; a ; "The Lwazi Community Communication Service: Design and Piloting of a Voice-Based Information Service" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , , , ; "Traffic Characterization and Internet Usage in Rural Africa" ; ; "While Internet connectivity has reached a significant part of the world's population, those living in rural areas of the developing world are still largely disconnected. Recent efforts have provided Internet connectivity to a growing number of remote locations, yet Internet traffic demands cause many of these networks to fail to deliver basic quality of service needed for simple applications. For an in-depth investigation of the problem, we gather and analyze network traces from a rural wireless network in Macha, Zambia. We supplement our analysis with on-site interviews from Macha, Zambia and Dwesa, South Africa, another rural community that hosts a local wireless network. The results reveal that Internet traffic in rural Africa differs significantly from the developed world. We observe dominance of web-based traffic, as opposed to peer-to-peer traffic common in urban areas. Application-wise, online social networks are the most popular, while the majority of bandwidth is consumed by large operating system updates. Our analysis also uncovers numerous network anomalies, such as significant malware traffic. Finally, we find a strong feedback loop between network performance and user behavior. Based on our findings, we conclude with a discussion of new directions in network design that take into account both technical and social factors." ; , , , ; "March/April" ; "493" ; ; "2011" ; a ; "Traffic Characterization and Internet Usage in Rural Africa" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , , , , ; "Two-Stream Indexing for Spoken Web Search" ; ; "This paper presents two-stream processing of audio to index the audio content for Spoken Web search. The first stream indexes the meta-data associated with a particular audio document. The meta-data is usually very sparse, but accurate. This therefore results in a high-precision, low-recall index. The second stream uses a novel language-independent speech recognition to generate text to be indexed. Owing to the multiple languages and the noise in user generated content on the Spoken Web, the speech recognition accuracy of such systems is not high, thus they result in a low-precision, high-recall index. The paper attempts to use these two complementary streams to generate a combined index to increase the precision-recall performance in audio content search. The problem of audio content search is motivated by the real world implication of the Web in developing regions, where due to literacy and affordability issues, people use Spoken Web which consists of interconnected VoiceSites, which have content in audio. The experiments are based on more than 20,000 audio documents spanning over seven live VoiceSites and four different languages. The results suggest significant improvement over a meta-data-only or a speech-recognitiononly system, thus justifying the two-stream processing approach. Audio content search is a growing problem area and this paper wishes to be a first step to solving this at a large scale, across languages, in a Web context." ; , , , , , , ; "March/April" ; "503" ; ; "2011" ; a ; "Two-Stream Indexing for Spoken Web Search" ; , , , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; rdf:_7 ; a rdf:Seq . a ; "Break: Tea Break" ; "2011-03-30T10:30:00+05:30" ; "2011-03-30T10:00:00+05:30" ; ; "Break: Tea Break" . a ; "Break: Lunch Break" ; "2011-03-31T13:30:00+05:30" ; "2011-03-31T12:00:00+05:30" ; ; "Break: Lunch Break" . a ; "Break: Tea Break" ; "2011-04-01T15:30:00+05:30" ; "2011-04-01T15:00:00+05:30" ; ; "Break: Tea Break" . a ; "Break: Tea Break" ; "2011-03-31T10:30:00+05:30" ; "2011-03-31T10:00:00+05:30" ; ; "Break: Tea Break" . a ; "Break: Lunch Break" ; "2011-03-31T13:30:00+05:30" ; "2011-03-31T12:00:00+05:30" ; ; "Break: Lunch Break" . a ; "Break: Tea Break" ; "2011-03-31T15:30:00+05:30" ; "2011-03-31T15:00:00+05:30" ; ; "Break: Tea Break" . a ; "Break: Tea Break" ; "2011-04-01T10:30:00+05:30" ; "2011-04-01T10:00:00+05:30" ; ; "Break: Tea Break" . a ; "Break: Lunch Break" ; "2011-04-01T13:30:00+05:30" ; "2011-04-01T12:00:00+05:30" ; ; "Break: Lunch Break" . a ; "Break: Tea Break" ; "2011-04-01T15:30:00+05:30" ; "2011-04-01T15:00:00+05:30" ; ; "Break: Tea Break" . a ; "Social Event: High Tea with industry leaders" ; "2011-03-29T19:30:00+05:30" ; "2011-03-29T18:30:00+05:30" ; ; "Social Event: High Tea with industry leaders" . a ; "Social Event: Welcome Reception Dinner" ; "2011-03-30T21:00:00+05:30" ; "2011-03-30T19:00:00+05:30" ; ; "Social Event: Welcome Reception Dinner" . a ; "Social Event: Banquet Dinner with social event" ; "2011-03-31T21:00:00+05:30" ; "2011-03-31T19:00:00+05:30" ; ; "Social Event: Banquet Dinner with social event" . a ; "Valedictory: Valedictory Function" ; "2011-04-01T17:45:00+05:30" ; "2011-04-01T17:15:00+05:30" ; ; "Valedictory: Valedictory Function" . a ; "Anant Jhingran" ; "Developers Track: Keynote: Cloud Computing - Different Cloud Models and Programming to them" ; "Anant Jhingran" ; "2011-03-30T09:30:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Developers Track: Keynote: Cloud Computing - Different Cloud Models and Programming to them" ; . a ; "Bharat Shyam, Microsoft" ; "Developers Track: Tutorial 1: Introduction to Windows Azure: Programming to a PaaS" ; "Bharat Shyam, Microsoft" ; "2011-03-30T15:00:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Developers Track: Tutorial 1: Introduction to Windows Azure: Programming to a PaaS" ; . a ; "Patrick Chanezon & Rajdeep Dua, Google" ; "Developers Track: Tutorial 2: Google Cloud services for Big Data" ; "Patrick Chanezon & Rajdeep Dua, Google" ; "2011-03-30T17:00:00+05:30" ; "2011-03-30T15:30:00+05:30" ; ; "Developers Track: Tutorial 2: Google Cloud services for Big Data" ; . a ; "Shanmugam Senthil, Yahoo" ; "Developers Track: Tutorial 3: Scaling Hadoop to handle Big Data" ; "Shanmugam Senthil, Yahoo" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T10:30:00+05:30" ; ; "Developers Track: Tutorial 3: Scaling Hadoop to handle Big Data" ; . a ; "Mukund Deshpande, Persistent Systems" ; "Developers Track: Tutorial 4: Analytics on Hive" ; "Mukund Deshpande, Persistent Systems" ; "2011-03-31T15:00:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Developers Track: Tutorial 4: Analytics on Hive" ; . a ; "Srinivas Padmanabhuni, Infosys" ; "Developers Track: Tutorial 5: Cloud Security – Developers’ Desiderata" ; "Srinivas Padmanabhuni, Infosys" ; "2011-03-31T17:00:00+05:30" ; "2011-03-31T15:30:00+05:30" ; ; "Developers Track: Tutorial 5: Cloud Security – Developers’ Desiderata" ; . a ; "Rajdeep Dua, Google" ; "Developers Track: Code Lab" ; "Rajdeep Dua, Google" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T10:30:00+05:30" ; ; "Developers Track: Code Lab" . a ; "Moderator: Chandra (CEO, Tata Consultancy Services) / Panelists: Kris Gopalakrishnan (CEO and MD, Infosys), N Ravishanker (IAS, Jt Secretary and CEO NIXI (National Internet Exchange of India)), Dr. Phatak (Indian Institute of Technology, Mumbai)" ; "Industry Plenary Panel: A Universal, Inclusive WWW - The Next Frontier" ; "Moderator: Chandra (CEO, Tata Consultancy Services) / Panelists: Kris Gopalakrishnan (CEO and MD, Infosys), N Ravishanker (IAS, Jt Secretary and CEO NIXI (National Internet Exchange of India)), Dr. Phatak (Indian Institute of Technology, Mumbai)" ; "2011-03-29T18:30:00+05:30" ; "2011-03-29T17:15:00+05:30" ; ; "Industry Plenary Panel: A Universal, Inclusive WWW - The Next Frontier" ; . a ; "Arun Kumar, IBM Research" ; "Industry Track: Spoken Web" ; "Arun Kumar, IBM Research" ; "2011-03-30T08:50:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Industry Track: Spoken Web" . a ; "Dr. Ajay Kolhatkar, Infosys" ; "Industry Track: Accessible Web (Accessibility for differently-abled and elderly)" ; "Dr. Ajay Kolhatkar, Infosys" ; "2011-03-30T09:10:00+05:30" ; "2011-03-30T08:50:00+05:30" ; ; "Industry Track: Accessible Web (Accessibility for differently-abled and elderly)" . a ; "Dr Arun Pande, TCS" ; "Industry Track: Web in Agriculture" ; "Dr Arun Pande, TCS" ; "2011-03-30T09:30:00+05:30" ; "2011-03-30T09:10:00+05:30" ; ; "Industry Track: Web in Agriculture" . a ; "Dr. R. Saravanan, Central Agricultural University" ; "Industry Track: Web for Agricultural Extension" ; "Dr. R. Saravanan, Central Agricultural University" ; "2011-03-30T09:50:00+05:30" ; "2011-03-30T09:30:00+05:30" ; ; "Industry Track: Web for Agricultural Extension" . a ; "Moderator: Subu Goparaju (SVP, Infosys) / Panelists: Anil Bahuman (Promoter, Managing Director, Agrocom), Ananth Krishnan (CTO, TCS), Prof. Rajeev Sangal (IIIT Hyderabad), I. Vijaya Kumar, (CTO, Wipro)" ; "Industry Panel: Collaborative and Social Web" ; "Moderator: Subu Goparaju (SVP, Infosys) / Panelists: Anil Bahuman (Promoter, Managing Director, Agrocom), Ananth Krishnan (CTO, TCS), Prof. Rajeev Sangal (IIIT Hyderabad), I. Vijaya Kumar, (CTO, Wipro)" ; "2011-03-30T14:30:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Industry Panel: Collaborative and Social Web" . a ; "Abhay Singavi, CEO - Preventive Health, Narayana Hrudayalaya" ; "Industry Track: Web for Healthcare" ; "Abhay Singavi, CEO - Preventive Health, Narayana Hrudayalaya" ; "2011-03-30T14:50:00+05:30" ; "2011-03-30T14:30:00+05:30" ; ; "Industry Track: Web for Healthcare" . a ; "Dr A Kumaran, Microsoft Research" ; "Industry Track: Wikibhasha" ; "Dr A Kumaran, Microsoft Research" ; "2011-03-30T15:50:00+05:30" ; "2011-03-30T15:30:00+05:30" ; ; "Industry Track: Wikibhasha" . a ; "Dr. C. Kathiresan, InDG, C-DAC" ; "Industry Track: India development Gateway" ; "Dr. C. Kathiresan, InDG, C-DAC" ; "2011-03-30T16:10:00+05:30" ; "2011-03-30T15:50:00+05:30" ; ; "Industry Track: India development Gateway" . a ; "Dr. Ashwin Mahesh, CEO, Mapunity" ; "Industry Track: Web for traffic management" ; "Dr. Ashwin Mahesh, CEO, Mapunity" ; "2011-03-30T16:30:00+05:30" ; "2011-03-30T16:10:00+05:30" ; ; "Industry Track: Web for traffic management" . a ; "European Patents Office" ; "Industry Track: Software Patents" ; "European Patents Office" ; "2011-03-30T16:50:00+05:30" ; "2011-03-30T16:30:00+05:30" ; ; "Industry Track: Software Patents" . ; ; a ; "The Computer Is the New Sewing Machine: Benefits and Perils of Crowdsourcing" ; "2011-03-30T17:00:00+05:30" ; "2011-03-30T15:30:00+05:30" ; ; "The Computer Is the New Sewing Machine: Benefits and Perils of Crowdsourcing" . , , , ; ; a ; "Panelist at WWW2011 (PD-01)" . ; ; a ; "Social Media: Source of Information or Bunch of Noise" ; "2011-03-31T17:00:00+05:30" ; "2011-03-31T15:30:00+05:30" ; ; "Social Media: Source of Information or Bunch of Noise" . , , , , , ; ; a ; "Panelist at WWW2011 (PD-02)" . ; ; a ; "Connecting the Next Billion Web Users" ; "2011-04-01T17:00:00+05:30" ; "2011-04-01T15:30:00+05:30" ; ; "Connecting the Next Billion Web Users" . , , , , , ; ; a ; "Panelist at WWW2011 (PD-03)" . ; ; a ; "Distributed Web Retrieval" ; "2011-03-28T12:00:00+05:30" ; "2011-03-28T08:30:00+05:30" ; ; "Distributed Web Retrieval" ; . ; ; a ; "Tutorial Presenter at WWW2011 (T-01)" . ; ; a ; "Social Recommender Systems" ; "2011-03-29T17:00:00+05:30" ; "2011-03-29T13:30:00+05:30" ; ; "Social Recommender Systems" ; . , ; ; a ; "Tutorial Presenter at WWW2011 (T-02)" . ; ; a ; "Ranking on Large-Scale Graphs with Rich Metadata" ; "2011-03-28T12:00:00+05:30" ; "2011-03-28T08:30:00+05:30" ; ; "Ranking on Large-Scale Graphs with Rich Metadata" ; . , , ; ; a ; "Tutorial Presenter at WWW2011 (T-03)" . ; ; a ; "Citizen Sensor Data Mining, Social Media Analytics and Development Centric Web Applications" ; "2011-03-28T12:00:00+05:30" ; "2011-03-28T08:30:00+05:30" ; ; "Citizen Sensor Data Mining, Social Media Analytics and Development Centric Web Applications" ; . , , ; ; a ; "Tutorial Presenter at WWW2011 (T-04)" . ; ; a ; "Game Theoretic Models for Social Network Analysis" ; "2011-03-28T17:00:00+05:30" ; "2011-03-28T13:30:00+05:30" ; ; "Game Theoretic Models for Social Network Analysis" ; . , ; ; a ; "Tutorial Presenter at WWW2011 (T-05)" . ; ; a ; "Speech and Multimodal Interaction in Mobile Search" ; "2011-03-28T17:00:00+05:30" ; "2011-03-28T13:30:00+05:30" ; ; "Speech and Multimodal Interaction in Mobile Search" ; . , , ; ; a ; "Tutorial Presenter at WWW2011 (T-06)" . ; ; a ; "Social Media Analytics: Tracking, Modeling and Predicting the Flow of Information Through Networks" ; "2011-03-29T12:00:00+05:30" ; "2011-03-29T08:30:00+05:30" ; ; "Social Media Analytics: Tracking, Modeling and Predicting the Flow of Information Through Networks" ; . ; ; a ; "Tutorial Presenter at WWW2011 (T-07)" . ; ; a ; "Managing Crowdsourced Human Computation" ; "2011-03-29T15:00:00+05:30" ; "2011-03-29T08:30:00+05:30" ; ; "Managing Crowdsourced Human Computation" ; . , ; ; a ; "Tutorial Presenter at WWW2011 (T-08)" . ; ; a ; "Scalable Integration and Processing of Linked Data" ; "2011-03-29T15:00:00+05:30" ; "2011-03-29T08:30:00+05:30" ; ; "Scalable Integration and Processing of Linked Data" ; . , , , ; ; a ; "Tutorial Presenter at WWW2011 (T-09)" . ; ; a ; "Web-Based Open-Domain Information Extraction" ; "2011-03-29T15:00:00+05:30" ; "2011-03-29T08:30:00+05:30" ; ; "Web-Based Open-Domain Information Extraction" ; . ; ; a ; "Tutorial Presenter at WWW2011 (T-10)" . ; ; a ; "WWW 2011 Invited Tutorial Overview: Latent Variable Models on the Internet" ; "2011-03-29T17:00:00+05:30" ; "2011-03-29T13:30:00+05:30" ; ; "WWW 2011 Invited Tutorial Overview: Latent Variable Models on the Internet" ; . , ; ; a ; "Tutorial Presenter at WWW2011 (T-11)" . ; ; a ; "The Web of Things" ; "2011-03-29T17:00:00+05:30" ; "2011-03-29T13:30:00+05:30" ; ; "The Web of Things" ; . , ; ; a ; "Tutorial Presenter at WWW2011 (T-12)" . a ; "Shadi Abou-Zhara and Richard Ishida" ; "W3C-Day1: Accessible and multilingual Web" ; "Shadi Abou-Zhara and Richard Ishida" ; "2011-03-30T10:00:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "W3C-Day1: Accessible and multilingual Web" ; . a ; "Shadi Abou-Zhara and Richard Ishida" ; "W3C-Day1: Accessible and multilingual Web" ; "Shadi Abou-Zhara and Richard Ishida" ; "2011-03-30T15:00:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "W3C-Day1: Accessible and multilingual Web" ; . a ; "Shadi Abou-Zhara and Richard Ishida" ; "W3C-Day1: Accessible and multilingual Web" ; "Shadi Abou-Zhara and Richard Ishida" ; "2011-03-30T17:00:00+05:30" ; "2011-03-30T15:30:00+05:30" ; ; "W3C-Day1: Accessible and multilingual Web" ; . a ; "Dominique Hazael-Massieux and Francois Daoust" ; "W3C-Day2: Mobile Web applications" ; "Dominique Hazael-Massieux and Francois Daoust" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T10:30:00+05:30" ; ; "W3C-Day2: Mobile Web applications" ; . a ; "Dominique Hazael-Massieux and Francois Daoust" ; "W3C-Day2: Mobile Web applications" ; "Dominique Hazael-Massieux and Francois Daoust" ; "2011-03-31T15:00:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "W3C-Day2: Mobile Web applications" ; . a ; "Dominique Hazael-Massieux and Francois Daoust" ; "W3C-Day2: Mobile Web applications" ; "Dominique Hazael-Massieux and Francois Daoust" ; "2011-03-31T17:00:00+05:30" ; "2011-03-31T15:30:00+05:30" ; ; "W3C-Day2: Mobile Web applications" ; . a ; "W4A-Day1: Web 4 All Conference" ; "2011-03-28T17:00:00+05:30" ; "2011-03-28T08:30:00+05:30" ; ; "W4A-Day1: Web 4 All Conference" ; . a ; "W4A-Day2: Web 4 All Conference" ; "2011-03-29T17:00:00+05:30" ; "2011-03-29T08:30:00+05:30" ; ; "W4A-Day2: Web 4 All Conference" ; . ; ; a ; "Demo: Visual Query System for Analyzing Social Semantic Web" ; "2011-03-30T10:30:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Demo: Visual Query System for Analyzing Social Semantic Web" . ; ; a ; "Demo: Adapting a Map Query Interface for a Gesturing Touch Screen Interface" ; "2011-03-30T10:30:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Demo: Adapting a Map Query Interface for a Gesturing Touch Screen Interface" . ; ; a ; "Demo: T-RecS: Team Recommendation System through Expertise and Cohesiveness" ; "2011-03-30T10:30:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Demo: T-RecS: Team Recommendation System through Expertise and Cohesiveness" . ; ; a ; "Demo: Blognoon: Exploring a Topic in the Blogosphere" ; "2011-03-30T10:30:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Demo: Blognoon: Exploring a Topic in the Blogosphere" . ; ; a ; "Demo: Embedding MindMap As a Service for User-Driven Composition of Web Applications" ; "2011-03-30T10:30:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Demo: Embedding MindMap As a Service for User-Driven Composition of Web Applications" . ; ; a ; "Demo: Einstein: Physicist or Vegetarian? Summarizing Semantic Type Graphs for Knowledge Discovery" ; "2011-03-30T10:30:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Demo: Einstein: Physicist or Vegetarian? Summarizing Semantic Type Graphs for Knowledge Discovery" . ; ; a ; "Demo: CATE: Context-Aware Timeline for Entity Illustration" ; "2011-03-30T10:30:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Demo: CATE: Context-Aware Timeline for Entity Illustration" . ; ; a ; "Demo: OntoTrix: A Hybrid Visualization for Populated Ontologies" ; "2011-03-30T10:30:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Demo: OntoTrix: A Hybrid Visualization for Populated Ontologies" . ; ; a ; "Demo: Visual Query System for Analyzing Social Semantic Web" ; "2011-03-30T15:30:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Demo: Visual Query System for Analyzing Social Semantic Web" . ; ; a ; "Demo: Adapting a Map Query Interface for a Gesturing Touch Screen Interface" ; "2011-03-30T15:30:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Demo: Adapting a Map Query Interface for a Gesturing Touch Screen Interface" . ; ; a ; "Demo: T-RecS: Team Recommendation System through Expertise and Cohesiveness" ; "2011-03-30T15:30:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Demo: T-RecS: Team Recommendation System through Expertise and Cohesiveness" . ; ; a ; "Demo: Blognoon: Exploring a Topic in the Blogosphere" ; "2011-03-30T15:30:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Demo: Blognoon: Exploring a Topic in the Blogosphere" . ; ; a ; "Demo: Embedding MindMap As a Service for User-Driven Composition of Web Applications" ; "2011-03-30T15:30:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Demo: Embedding MindMap As a Service for User-Driven Composition of Web Applications" . ; ; a ; "Demo: Einstein: Physicist or Vegetarian? Summarizing Semantic Type Graphs for Knowledge Discovery" ; "2011-03-30T15:30:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Demo: Einstein: Physicist or Vegetarian? Summarizing Semantic Type Graphs for Knowledge Discovery" . ; ; a ; "Demo: CATE: Context-Aware Timeline for Entity Illustration" ; "2011-03-30T15:30:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Demo: CATE: Context-Aware Timeline for Entity Illustration" . ; ; a ; "Demo: OntoTrix: A Hybrid Visualization for Populated Ontologies" ; "2011-03-30T15:30:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Demo: OntoTrix: A Hybrid Visualization for Populated Ontologies" . ; ; a ; "Demo: CoSi: Context-Sensitive Keyword Query Interpretation on RDF Databases" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T10:00:00+05:30" ; ; "Demo: CoSi: Context-Sensitive Keyword Query Interpretation on RDF Databases" . ; ; a ; "Demo: Accelerating Instant Question Search with Database Techniques" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T10:00:00+05:30" ; ; "Demo: Accelerating Instant Question Search with Database Techniques" . ; ; a ; "Demo: CONQUER: A System for Efficient Context-aware Query Suggestion" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T10:00:00+05:30" ; ; "Demo: CONQUER: A System for Efficient Context-aware Query Suggestion" . ; ; a ; "Demo: YAGO2: Exploring and Querying World Knowledge in Time, Space, Context, and Many Languages" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T10:00:00+05:30" ; ; "Demo: YAGO2: Exploring and Querying World Knowledge in Time, Space, Context, and Many Languages" . ; ; a ; "Demo: DIDO: a Disease-Determinants Ontology from Web Sources" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T10:00:00+05:30" ; ; "Demo: DIDO: a Disease-Determinants Ontology from Web Sources" . ; ; a ; "Demo: Automatically Building Probabilistic Databases from the Web" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T10:00:00+05:30" ; ; "Demo: Automatically Building Probabilistic Databases from the Web" . ; ; a ; "Demo: OXPath: Little Language, Little Memory, Great Value" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T10:00:00+05:30" ; ; "Demo: OXPath: Little Language, Little Memory, Great Value" . ; ; a ; "Demo: Truthy: Mapping the Spread of Astroturf in Microblog Streams" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T10:00:00+05:30" ; ; "Demo: Truthy: Mapping the Spread of Astroturf in Microblog Streams" . ; ; a ; "Demo: CoSi: Context-Sensitive Keyword Query Interpretation on RDF Databases" ; "2011-03-31T15:30:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Demo: CoSi: Context-Sensitive Keyword Query Interpretation on RDF Databases" . ; ; a ; "Demo: Accelerating Instant Question Search with Database Techniques" ; "2011-03-31T15:30:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Demo: Accelerating Instant Question Search with Database Techniques" . ; ; a ; "Demo: CONQUER: A System for Efficient Context-aware Query Suggestion" ; "2011-03-31T15:30:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Demo: CONQUER: A System for Efficient Context-aware Query Suggestion" . ; ; a ; "Demo: YAGO2: Exploring and Querying World Knowledge in Time, Space, Context, and Many Languages" ; "2011-03-31T15:30:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Demo: YAGO2: Exploring and Querying World Knowledge in Time, Space, Context, and Many Languages" . ; ; a ; "Demo: DIDO: a Disease-Determinants Ontology from Web Sources" ; "2011-03-31T15:30:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Demo: DIDO: a Disease-Determinants Ontology from Web Sources" . ; ; a ; "Demo: Automatically Building Probabilistic Databases from the Web" ; "2011-03-31T15:30:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Demo: Automatically Building Probabilistic Databases from the Web" . ; ; a ; "Demo: OXPath: Little Language, Little Memory, Great Value" ; "2011-03-31T15:30:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Demo: OXPath: Little Language, Little Memory, Great Value" . ; ; a ; "Demo: Truthy: Mapping the Spread of Astroturf in Microblog Streams" ; "2011-03-31T15:30:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Demo: Truthy: Mapping the Spread of Astroturf in Microblog Streams" . ; ; a ; "Demo: Factal: Integrating Deep Web Based on Trust and Relevance" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T10:00:00+05:30" ; ; "Demo: Factal: Integrating Deep Web Based on Trust and Relevance" . ; ; a ; "Demo: Exploratory search in multi-domain information spaces with Liquid Query" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T10:00:00+05:30" ; ; "Demo: Exploratory search in multi-domain information spaces with Liquid Query" . ; ; a ; "Demo: A Demo Search Engine for Products" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T10:00:00+05:30" ; ; "Demo: A Demo Search Engine for Products" . ; ; a ; "Demo: A User-Tunable Approach to Marketplace Search" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T10:00:00+05:30" ; ; "Demo: A User-Tunable Approach to Marketplace Search" . ; ; a ; "Demo: A Tool for Fast Indexing and Querying of Graphs" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T10:00:00+05:30" ; ; "Demo: A Tool for Fast Indexing and Querying of Graphs" . ; ; a ; "Demo: Helix: Online Enterprise Data Analytics" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T10:00:00+05:30" ; ; "Demo: Helix: Online Enterprise Data Analytics" . ; ; a ; "Demo: LivePulse: Tapping Social Media for Sentiments in Real-Time" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T10:00:00+05:30" ; ; "Demo: LivePulse: Tapping Social Media for Sentiments in Real-Time" . ; ; a ; "Demo: VoiSTV: Voice-Enabled Social TV" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T10:00:00+05:30" ; ; "Demo: VoiSTV: Voice-Enabled Social TV" . ; ; a ; "Demo: Filtering microblogging messages for Social TV" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T10:00:00+05:30" ; ; "Demo: Filtering microblogging messages for Social TV" . ; ; a ; "Demo: Factal: Integrating Deep Web Based on Trust and Relevance" ; "2011-04-01T15:30:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Demo: Factal: Integrating Deep Web Based on Trust and Relevance" . ; ; a ; "Demo: Exploratory search in multi-domain information spaces with Liquid Query" ; "2011-04-01T15:30:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Demo: Exploratory search in multi-domain information spaces with Liquid Query" . ; ; a ; "Demo: A Demo Search Engine for Products" ; "2011-04-01T15:30:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Demo: A Demo Search Engine for Products" . ; ; a ; "Demo: A User-Tunable Approach to Marketplace Search" ; "2011-04-01T15:30:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Demo: A User-Tunable Approach to Marketplace Search" . ; ; a ; "Demo: A Tool for Fast Indexing and Querying of Graphs" ; "2011-04-01T15:30:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Demo: A Tool for Fast Indexing and Querying of Graphs" . ; ; a ; "Demo: Helix: Online Enterprise Data Analytics" ; "2011-04-01T15:30:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Demo: Helix: Online Enterprise Data Analytics" . ; ; a ; "Demo: LivePulse: Tapping Social Media for Sentiments in Real-Time" ; "2011-04-01T15:30:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Demo: LivePulse: Tapping Social Media for Sentiments in Real-Time" . ; ; a ; "Demo: VoiSTV: Voice-Enabled Social TV" ; "2011-04-01T15:30:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Demo: VoiSTV: Voice-Enabled Social TV" . ; ; a ; "Demo: Filtering microblogging messages for Social TV" ; "2011-04-01T15:30:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Demo: Filtering microblogging messages for Social TV" . ; a ; "Keynote Address by Dr. A. P. J. Abdul Kalam" ; "2011-03-30T12:00:00+05:30" ; "2011-03-30T10:30:00+05:30" ; ; "Keynote Address by Dr. A. P. J. Abdul Kalam" . ; a ; "Keynote Address by Sir Tim Berners-Lee" ; "2011-03-31T10:00:00+05:30" ; "2011-03-31T08:30:00+05:30" ; ; "Keynote Address by Sir Tim Berners-Lee" . ; a ; "Keynote Address by Christos H. Papadimitriou" ; "2011-04-01T10:00:00+05:30" ; "2011-04-01T08:30:00+05:30" ; ; "Keynote Address by Christos H. Papadimitriou" . ; ; a ; "Paper Presentation: Cooperative Anti-Spam System Based On Multilayer Agents" ; "2011-04-01T15:00:00+05:30" ; "2011-04-01T14:30:00+05:30" ; ; "Paper Presentation: Cooperative Anti-Spam System Based On Multilayer Agents" . ; ; a ; "Paper Presentation: Measurement and Analysis of Cyberlocker Services" ; "2011-04-01T16:00:00+05:30" ; "2011-04-01T15:30:00+05:30" ; ; "Paper Presentation: Measurement and Analysis of Cyberlocker Services" . ; ; a ; "Paper Presentation: Towards Liquid Service Oriented Architectures" ; "2011-04-01T16:30:00+05:30" ; "2011-04-01T16:00:00+05:30" ; ; "Paper Presentation: Towards Liquid Service Oriented Architectures" . ; ; a ; "Paper Presentation: Performance Enhancement of Scheduling Algorithms in Clusters and Grids using Improved Dynamic Load Balancing Techniques" ; "2011-04-01T17:00:00+05:30" ; "2011-04-01T16:30:00+05:30" ; ; "Paper Presentation: Performance Enhancement of Scheduling Algorithms in Clusters and Grids using Improved Dynamic Load Balancing Techniques" . ; ; a ; "Paper Presentation: Computational Advertising: Leveraging User Interaction & Contextual Factors for Improved Ad Retrieval & Ranking" ; "2011-04-01T11:00:00+05:30" ; "2011-04-01T10:30:00+05:30" ; ; "Paper Presentation: Computational Advertising: Leveraging User Interaction & Contextual Factors for Improved Ad Retrieval & Ranking" . ; ; a ; "Paper Presentation: Standing on the Shoulders of Ants: Stigmergy in the Web" ; "2011-04-01T11:30:00+05:30" ; "2011-04-01T11:00:00+05:30" ; ; "Paper Presentation: Standing on the Shoulders of Ants: Stigmergy in the Web" . ; ; a ; "Paper Presentation: Dynamic Learning-based Mechanism Design for Dependent Valued Exchange Economies" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T11:30:00+05:30" ; ; "Paper Presentation: Dynamic Learning-based Mechanism Design for Dependent Valued Exchange Economies" . ; ; a ; "Paper Presentation: Fuzzy Associative Rule-based Approach for Pattern Mining and Identification and Pattern-based Classification" ; "2011-04-01T14:00:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Paper Presentation: Fuzzy Associative Rule-based Approach for Pattern Mining and Identification and Pattern-based Classification" . ; ; a ; "Paper Presentation: Ranked answer graph construction for keyword queries on RDF graphs without distance neighbourhood restriction" ; "2011-04-01T14:30:00+05:30" ; "2011-04-01T14:00:00+05:30" ; ; "Paper Presentation: Ranked answer graph construction for keyword queries on RDF graphs without distance neighbourhood restriction" . ; ; a ; "Paper Presentation: Addressing the RDFa Publishing Bottleneck" ; "2011-04-01T15:00:00+05:30" ; "2011-04-01T14:30:00+05:30" ; ; "Paper Presentation: Addressing the RDFa Publishing Bottleneck" . ; ; a ; "Paper Presentation: Application of Semantic Web Technologies for Multimedia Interpretation" ; "2011-04-01T16:00:00+05:30" ; "2011-04-01T15:30:00+05:30" ; ; "Paper Presentation: Application of Semantic Web Technologies for Multimedia Interpretation" . ; ; a ; "Paper Presentation: The OXPath to Success in the Deep Web" ; "2011-04-01T16:30:00+05:30" ; "2011-04-01T16:00:00+05:30" ; ; "Paper Presentation: The OXPath to Success in the Deep Web" . ; ; a ; "Paper Presentation: Analysis and Tracking of Emotions in English and Bengali Texts: A Computational Approach" ; "2011-04-01T11:00:00+05:30" ; "2011-04-01T10:30:00+05:30" ; ; "Paper Presentation: Analysis and Tracking of Emotions in English and Bengali Texts: A Computational Approach" . ; ; a ; "Paper Presentation: A Politeness Recognition Tool for Hindi: With Special Emphasis on Online Texts" ; "2011-04-01T11:30:00+05:30" ; "2011-04-01T11:00:00+05:30" ; ; "Paper Presentation: A Politeness Recognition Tool for Hindi: With Special Emphasis on Online Texts" . ; ; a ; "Paper Presentation: Sentence-Level Contextual Opinion Retrieval" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T11:30:00+05:30" ; ; "Paper Presentation: Sentence-Level Contextual Opinion Retrieval" . ; ; a ; "Paper Presentation: Summarization of Archived and Shared Personal Photo Collections" ; "2011-04-01T14:00:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Paper Presentation: Summarization of Archived and Shared Personal Photo Collections" . ; ; a ; "Paper Presentation: Wikipedia Vandalism Detection" ; "2011-04-01T14:30:00+05:30" ; "2011-04-01T14:00:00+05:30" ; ; "Paper Presentation: Wikipedia Vandalism Detection" . a ; "Posters Display" ; "2011-03-30T18:00:00+05:00" ; "2011-03-30T10:00:00+05:00" ; ; "Posters Display" . a ; "Posters Display" ; "2011-03-31T19:00:00+05:00" ; "2011-03-31T10:00:00+05:00" ; ; "Posters Display" . a ; "Posters Display" ; "2011-01-01T18:00:00+05:00" ; "2011-01-01T10:00:00+05:00" ; ; "Posters Display" . a ; "Posters Display" ; "2011-01-02T19:00:00+05:00" ; "2011-01-02T17:00:00+05:00" ; ; "Posters Display" . ; ; a ; "Paper Presentation: Differences in the Mechanics of Information Diffusion Across Topics: Idioms, Political Hashtags, and Complex Contagion on Twitter" ; "2011-03-30T09:00:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Paper Presentation: Differences in the Mechanics of Information Diffusion Across Topics: Idioms, Political Hashtags, and Complex Contagion on Twitter" . ; ; a ; "Paper Presentation: Who Says What to Whom on Twitter" ; "2011-03-30T09:30:00+05:30" ; "2011-03-30T09:00:00+05:30" ; ; "Paper Presentation: Who Says What to Whom on Twitter" . ; ; a ; "Paper Presentation: we.b: The web of short URLs" ; "2011-03-30T10:00:00+05:30" ; "2011-03-30T09:30:00+05:30" ; ; "Paper Presentation: we.b: The web of short URLs" . ; ; a ; "Paper Presentation: Sparse Hidden-Dynamics Conditional Random Fields for User Intent Understanding" ; "2011-03-30T14:00:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Paper Presentation: Sparse Hidden-Dynamics Conditional Random Fields for User Intent Understanding" . ; ; a ; "Paper Presentation: Characterizing Search Intent Diversity into Click Models" ; "2011-03-30T14:30:00+05:30" ; "2011-03-30T14:00:00+05:30" ; ; "Paper Presentation: Characterizing Search Intent Diversity into Click Models" . ; ; a ; "Paper Presentation: Addressing People's Information Needs Directly in a Web Search Result Page" ; "2011-03-30T15:00:00+05:30" ; "2011-03-30T14:30:00+05:30" ; ; "Paper Presentation: Addressing People's Information Needs Directly in a Web Search Result Page" . ; ; a ; "Paper Presentation: Here, There and Everywhere: Correlated Online Behaviors Can Lead to Overestimates of the Effects of Advertising" ; "2011-03-30T14:00:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Paper Presentation: Here, There and Everywhere: Correlated Online Behaviors Can Lead to Overestimates of the Effects of Advertising" . ; ; a ; "Paper Presentation: Adaptive Policies for Selecting Groupon Style Chunked Reward Ads in a Stochastic Knapsack Framework" ; "2011-03-30T14:30:00+05:30" ; "2011-03-30T14:00:00+05:30" ; ; "Paper Presentation: Adaptive Policies for Selecting Groupon Style Chunked Reward Ads in a Stochastic Knapsack Framework" . ; ; a ; "Paper Presentation: A Game Theoretic Formulation of the Service Provisioning Problem in Cloud Systems" ; "2011-03-30T15:00:00+05:30" ; "2011-03-30T14:30:00+05:30" ; ; "Paper Presentation: A Game Theoretic Formulation of the Service Provisioning Problem in Cloud Systems" . ; ; a ; "Paper Presentation: Learning to Re-Rank: Query-Dependent Image Re-Ranking Using Click Data" ; "2011-03-30T16:00:00+05:30" ; "2011-03-30T15:30:00+05:30" ; ; "Paper Presentation: Learning to Re-Rank: Query-Dependent Image Re-Ranking Using Click Data" . ; ; a ; "Paper Presentation: Video Summarization via Transferrable Structured Learning" ; "2011-03-30T16:30:00+05:30" ; "2011-03-30T16:00:00+05:30" ; ; "Paper Presentation: Video Summarization via Transferrable Structured Learning" . ; ; a ; "Paper Presentation: Towards Semantic Knowledge Propagation from Text Corpus to Web Images" ; "2011-03-30T17:00:00+05:30" ; "2011-03-30T16:30:00+05:30" ; ; "Paper Presentation: Towards Semantic Knowledge Propagation from Text Corpus to Web Images" . ; ; a ; "Paper Presentation: Learning to Rank with Multiple Objective Functions" ; "2011-03-30T09:00:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Paper Presentation: Learning to Rank with Multiple Objective Functions" . ; ; a ; "Paper Presentation: A Stochastic Learning-To-Rank Algorithm and Its Application to Contextual Advertising" ; "2011-03-30T09:30:00+05:30" ; "2011-03-30T09:00:00+05:30" ; ; "Paper Presentation: A Stochastic Learning-To-Rank Algorithm and Its Application to Contextual Advertising" . ; ; a ; "Paper Presentation: Parallel Boosted Regression Trees for Web Search Ranking" ; "2011-03-30T10:00:00+05:30" ; "2011-03-30T09:30:00+05:30" ; ; "Paper Presentation: Parallel Boosted Regression Trees for Web Search Ranking" . ; ; a ; "Paper Presentation: A Unified Framework for Recommending Diverse and Relevant Queries" ; "2011-03-30T16:00:00+05:30" ; "2011-03-30T15:30:00+05:30" ; ; "Paper Presentation: A Unified Framework for Recommending Diverse and Relevant Queries" . ; ; a ; "Paper Presentation: Improving recommendation for long-tail queries via templates" ; "2011-03-30T16:30:00+05:30" ; "2011-03-30T16:00:00+05:30" ; ; "Paper Presentation: Improving recommendation for long-tail queries via templates" . ; ; a ; "Paper Presentation: Learning to Model Relatedness for News Recommendation" ; "2011-03-30T17:00:00+05:30" ; "2011-03-30T16:30:00+05:30" ; ; "Paper Presentation: Learning to Model Relatedness for News Recommendation" . ; ; a ; "Paper Presentation: Counting Triangles and the Curse of the Last Reducer" ; "2011-03-30T14:00:00+05:30" ; "2011-03-30T13:30:00+05:30" ; ; "Paper Presentation: Counting Triangles and the Curse of the Last Reducer" . ; ; a ; "Paper Presentation: Network Bucket Testing" ; "2011-03-30T14:30:00+05:30" ; "2011-03-30T14:00:00+05:30" ; ; "Paper Presentation: Network Bucket Testing" . ; ; a ; "Paper Presentation: HyperANF: Approximating the Neighbourhood Function of Large Graphs on a Budget" ; "2011-03-30T15:00:00+05:30" ; "2011-03-30T14:30:00+05:30" ; ; "Paper Presentation: HyperANF: Approximating the Neighbourhood Function of Large Graphs on a Budget" . ; ; a ; "Paper Presentation: Semi-Supervised Truth Discovery" ; "2011-03-30T16:00:00+05:30" ; "2011-03-30T15:30:00+05:30" ; ; "Paper Presentation: Semi-Supervised Truth Discovery" . ; ; a ; "Paper Presentation: SourceRank: Relevance and Trust Assessment for Deep Web Sources Based on Inter-Source Agreement" ; "2011-03-30T16:30:00+05:30" ; "2011-03-30T16:00:00+05:30" ; ; "Paper Presentation: SourceRank: Relevance and Trust Assessment for Deep Web Sources Based on Inter-Source Agreement" . ; ; a ; "Paper Presentation: Search Result Diversity for Informational Queries" ; "2011-03-30T17:00:00+05:30" ; "2011-03-30T16:30:00+05:30" ; ; "Paper Presentation: Search Result Diversity for Informational Queries" . ; ; a ; "Paper Presentation: ARROW: Generating Signatures to Detect Drive-By Downloads" ; "2011-03-30T09:00:00+05:30" ; "2011-03-30T08:30:00+05:30" ; ; "Paper Presentation: ARROW: Generating Signatures to Detect Drive-By Downloads" . ; ; a ; "Paper Presentation: Prophiler: A fast filter for the large-scale detection of malicious web pages" ; "2011-03-30T09:30:00+05:30" ; "2011-03-30T09:00:00+05:30" ; ; "Paper Presentation: Prophiler: A fast filter for the large-scale detection of malicious web pages" . ; ; a ; "Paper Presentation: Heat-seeking honeypots: design and experience" ; "2011-03-30T10:00:00+05:30" ; "2011-03-30T09:30:00+05:30" ; ; "Paper Presentation: Heat-seeking honeypots: design and experience" . ; ; a ; "Paper Presentation: Pay as you Browse: Microcomputations as Micropayments in Web-based Services" ; "2011-03-31T11:00:00+05:30" ; "2011-03-31T10:30:00+05:30" ; ; "Paper Presentation: Pay as you Browse: Microcomputations as Micropayments in Web-based Services" . ; ; a ; "Paper Presentation: Consideration Set Generation in Commerce Search" ; "2011-03-31T11:30:00+05:30" ; "2011-03-31T11:00:00+05:30" ; ; "Paper Presentation: Consideration Set Generation in Commerce Search" . ; ; a ; "Paper Presentation: Towards a Theory Model for Product Search" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T11:30:00+05:30" ; ; "Paper Presentation: Towards a Theory Model for Product Search" . ; ; a ; "Paper Presentation: Track Globally, Deliver Locally: Improving Content Delivery Networks by Tracking Geographic Social Cascades" ; "2011-03-31T14:00:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Paper Presentation: Track Globally, Deliver Locally: Improving Content Delivery Networks by Tracking Geographic Social Cascades" . ; ; a ; "Paper Presentation: Measuring a Commercial Content Delivery Network" ; "2011-03-31T14:30:00+05:30" ; "2011-03-31T14:00:00+05:30" ; ; "Paper Presentation: Measuring a Commercial Content Delivery Network" . ; ; a ; "Paper Presentation: Turkalytics: Analytics for Human Computation" ; "2011-04-01T14:30:00+05:30" ; "2011-04-01T14:00:00+05:30" ; ; "Paper Presentation: Turkalytics: Analytics for Human Computation" . ; ; a ; "Paper Presentation: Query Segmentation Revisited" ; "2011-03-31T14:00:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Paper Presentation: Query Segmentation Revisited" . ; ; a ; "Paper Presentation: Context-Sensitive Query Auto-Completion" ; "2011-03-31T14:30:00+05:30" ; "2011-03-31T14:00:00+05:30" ; ; "Paper Presentation: Context-Sensitive Query Auto-Completion" . ; ; a ; "Paper Presentation: Online Spelling Correction for Query Completion" ; "2011-03-31T15:00:00+05:30" ; "2011-03-31T14:30:00+05:30" ; ; "Paper Presentation: Online Spelling Correction for Query Completion" . ; ; a ; "Paper Presentation: Inverted Index Compression via Online Document Routing" ; "2011-03-31T16:00:00+05:30" ; "2011-03-31T15:30:00+05:30" ; ; "Paper Presentation: Inverted Index Compression via Online Document Routing" . ; ; a ; "Paper Presentation: Efficiently Evaluating Graph Constraints in Content-Based Publish/Subscribe" ; "2011-03-31T16:30:00+05:30" ; "2011-03-31T16:00:00+05:30" ; ; "Paper Presentation: Efficiently Evaluating Graph Constraints in Content-Based Publish/Subscribe" . ; ; a ; "Paper Presentation: FACTO: A Fact Lookup Engine Based on Web Tables" ; "2011-03-31T17:00:00+05:30" ; "2011-03-31T16:30:00+05:30" ; ; "Paper Presentation: FACTO: A Fact Lookup Engine Based on Web Tables" . ; ; a ; "Paper Presentation: A Word at a Time: Computing Word Relatedness using Temporal Semantic Analysis" ; "2011-03-31T11:00:00+05:30" ; "2011-03-31T10:30:00+05:30" ; ; "Paper Presentation: A Word at a Time: Computing Word Relatedness using Temporal Semantic Analysis" . ; ; a ; "Paper Presentation: Automatic Construction of a Context-Aware Sentiment Lexicon: An Optimization Approach" ; "2011-03-31T11:30:00+05:30" ; "2011-03-31T11:00:00+05:30" ; ; "Paper Presentation: Automatic Construction of a Context-Aware Sentiment Lexicon: An Optimization Approach" . ; ; a ; "Paper Presentation: Web scale NLP: A case study on URL word breaking" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T11:30:00+05:30" ; ; "Paper Presentation: Web scale NLP: A case study on URL word breaking" . ; ; a ; "Paper Presentation: Dynamics of Bidding in a P2P Lending Service: Effects of Herding and Predicting Loan Success" ; "2011-03-31T16:00:00+05:30" ; "2011-03-31T15:30:00+05:30" ; ; "Paper Presentation: Dynamics of Bidding in a P2P Lending Service: Effects of Herding and Predicting Loan Success" . ; ; a ; "Paper Presentation: Finding Hierarchy in Directed Online Social Networks" ; "2011-03-31T16:30:00+05:30" ; "2011-03-31T16:00:00+05:30" ; ; "Paper Presentation: Finding Hierarchy in Directed Online Social Networks" . ; ; a ; "Paper Presentation: Finding the bias and prestige of nodes in networks based on trust scores" ; "2011-03-31T17:00:00+05:30" ; "2011-03-31T16:30:00+05:30" ; ; "Paper Presentation: Finding the bias and prestige of nodes in networks based on trust scores" . ; ; a ; "Paper Presentation: Geographical topic discovery and comparison" ; "2011-03-31T11:00:00+05:30" ; "2011-03-31T10:30:00+05:30" ; ; "Paper Presentation: Geographical topic discovery and comparison" . ; ; a ; "Paper Presentation: The Web of Topics: Discovering the Topology of Topic Evolution in a Corpus" ; "2011-03-31T11:30:00+05:30" ; "2011-03-31T11:00:00+05:30" ; ; "Paper Presentation: The Web of Topics: Discovering the Topology of Topic Evolution in a Corpus" . ; ; a ; "Paper Presentation: Unified Analysis of Streaming News" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T11:30:00+05:30" ; ; "Paper Presentation: Unified Analysis of Streaming News" . ; ; a ; "Paper Presentation: We Know Who You Followed Last Summer: Inferring Social Link Creation Times In Twitter" ; "2011-03-31T14:00:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Paper Presentation: We Know Who You Followed Last Summer: Inferring Social Link Creation Times In Twitter" . ; ; a ; "Paper Presentation: Modeling the Temporal Dynamics of Social Rating Networks using Bidirectional Effects of Social Relations and Rating Patterns" ; "2011-03-31T14:30:00+05:30" ; "2011-03-31T14:00:00+05:30" ; ; "Paper Presentation: Modeling the Temporal Dynamics of Social Rating Networks using Bidirectional Effects of Social Relations and Rating Patterns" . ; ; a ; "Paper Presentation: Like like alike -- Joint friendship and interest propagation in social networks" ; "2011-03-31T15:00:00+05:30" ; "2011-03-31T14:30:00+05:30" ; ; "Paper Presentation: Like like alike -- Joint friendship and interest propagation in social networks" . ; ; a ; "Paper Presentation: Model Characterization Curves for Federated Search Using Click-Logs: Predicting User Engagement Metrics for the Span of Feasible Operating Points" ; "2011-03-31T16:00:00+05:30" ; "2011-03-31T15:30:00+05:30" ; ; "Paper Presentation: Model Characterization Curves for Federated Search Using Click-Logs: Predicting User Engagement Metrics for the Span of Feasible Operating Points" . ; ; a ; "Paper Presentation: Generalized Link Suggestions via Web Site Clustering" ; "2011-03-31T16:30:00+05:30" ; "2011-03-31T16:00:00+05:30" ; ; "Paper Presentation: Generalized Link Suggestions via Web Site Clustering" . ; ; a ; "Paper Presentation: A Self-Training Approach for Resolving Object Coreference on the Semantic Web" ; "2011-03-31T17:00:00+05:30" ; "2011-03-31T16:30:00+05:30" ; ; "Paper Presentation: A Self-Training Approach for Resolving Object Coreference on the Semantic Web" . ; ; a ; "Paper Presentation: Efficient K-Nearest Neighbor Graph Construction for Generic Similarity Measures" ; "2011-04-01T16:00:00+05:30" ; "2011-04-01T15:30:00+05:30" ; ; "Paper Presentation: Efficient K-Nearest Neighbor Graph Construction for Generic Similarity Measures" . ; ; a ; "Paper Presentation: Layered Label Propagation: A Multiresolution Coordinate-Free Ordering for Compressing Social Networks" ; "2011-04-01T16:30:00+05:30" ; "2011-04-01T16:00:00+05:30" ; ; "Paper Presentation: Layered Label Propagation: A Multiresolution Coordinate-Free Ordering for Compressing Social Networks" . ; ; a ; "Paper Presentation: Estimating Sizes of Social Networks via Biased Sampling" ; "2011-04-01T17:00:00+05:30" ; "2011-04-01T16:30:00+05:30" ; ; "Paper Presentation: Estimating Sizes of Social Networks via Biased Sampling" . ; ; a ; "Paper Presentation: Evaluating New Search Engine Configurations with Pre-Existing Judgments and Clicks" ; "2011-04-01T14:00:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Paper Presentation: Evaluating New Search Engine Configurations with Pre-Existing Judgments and Clicks" . ; ; a ; "Paper Presentation: On the Informativeness of Cascade and Intent-Aware Effectiveness Measures" ; "2011-04-01T14:30:00+05:30" ; "2011-04-01T14:00:00+05:30" ; ; "Paper Presentation: On the Informativeness of Cascade and Intent-Aware Effectiveness Measures" . ; ; a ; "Paper Presentation: Pragmatic Evaluation of Folksonomies" ; "2011-04-01T15:00:00+05:30" ; "2011-04-01T14:30:00+05:30" ; ; "Paper Presentation: Pragmatic Evaluation of Folksonomies" . ; ; a ; "Paper Presentation: Limiting the Spread of Misinformation in Social Networks" ; "2011-04-01T11:00:00+05:30" ; "2011-04-01T10:30:00+05:30" ; ; "Paper Presentation: Limiting the Spread of Misinformation in Social Networks" . ; ; a ; "Paper Presentation: Information Credibility on Twitter" ; "2011-04-01T11:30:00+05:30" ; "2011-04-01T11:00:00+05:30" ; ; "Paper Presentation: Information Credibility on Twitter" . ; ; a ; "Paper Presentation: SafeVchat: Detecting Obscene Content and Misbehaving Users in Online Video Chat Services" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T11:30:00+05:30" ; ; "Paper Presentation: SafeVchat: Detecting Obscene Content and Misbehaving Users in Online Video Chat Services" . ; ; a ; "Paper Presentation: SEISA: Set Expansion by Iterative Similarity Aggregation" ; "2011-04-01T11:00:00+05:30" ; "2011-04-01T10:30:00+05:30" ; ; "Paper Presentation: SEISA: Set Expansion by Iterative Similarity Aggregation" . ; ; a ; "Paper Presentation: Highly Efficient Algorithms For Structural Clustering of Large Websites" ; "2011-04-01T11:30:00+05:30" ; "2011-04-01T11:00:00+05:30" ; ; "Paper Presentation: Highly Efficient Algorithms For Structural Clustering of Large Websites" . ; ; a ; "Paper Presentation: SCAD: Collective Discovery of Attribute Values" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T11:30:00+05:30" ; ; "Paper Presentation: SCAD: Collective Discovery of Attribute Values" . ; ; a ; "Paper Presentation: Milgram-Routing in Social Networks" ; "2011-04-01T14:00:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Paper Presentation: Milgram-Routing in Social Networks" . ; ; a ; "Paper Presentation: Information Spreading in Context" ; "2011-04-01T14:30:00+05:30" ; "2011-04-01T14:00:00+05:30" ; ; "Paper Presentation: Information Spreading in Context" . ; ; a ; "Paper Presentation: Mark my words! Linguistic style accommodation in social media" ; "2011-04-01T15:00:00+05:30" ; "2011-04-01T14:30:00+05:30" ; ; "Paper Presentation: Mark my words! Linguistic style accommodation in social media" . ; ; a ; "Paper Presentation: An Expressive Mechanism for Auctions on the Web" ; "2011-04-01T16:00:00+05:30" ; "2011-04-01T15:30:00+05:30" ; ; "Paper Presentation: An Expressive Mechanism for Auctions on the Web" . ; ; a ; "Paper Presentation: Incentivizing High-quality User-Generated Content" ; "2011-04-01T16:30:00+05:30" ; "2011-04-01T16:00:00+05:30" ; ; "Paper Presentation: Incentivizing High-quality User-Generated Content" . ; ; a ; "Paper Presentation: Buy-it-now or Take-a-chance: A simple sequential screening mechanism" ; "2011-04-01T17:00:00+05:30" ; "2011-04-01T16:30:00+05:30" ; ; "Paper Presentation: Buy-it-now or Take-a-chance: A simple sequential screening mechanism" . ; ; a ; "Paper Presentation: EP-SPARQL: A Unified Language for Event Processing and Stream Reasoning" ; "2011-04-01T16:00:00+05:30" ; "2011-04-01T15:30:00+05:30" ; ; "Paper Presentation: EP-SPARQL: A Unified Language for Event Processing and Stream Reasoning" . ; ; a ; "Paper Presentation: A Better Uncle for OWL: Nominal Schemas for Integrating Rules and Ontologies" ; "2011-04-01T16:30:00+05:30" ; "2011-04-01T16:00:00+05:30" ; ; "Paper Presentation: A Better Uncle for OWL: Nominal Schemas for Integrating Rules and Ontologies" . ; ; a ; "Paper Presentation: Rewriting Queries on SPARQL Views" ; "2011-04-01T17:00:00+05:30" ; "2011-04-01T16:30:00+05:30" ; ; "Paper Presentation: Rewriting Queries on SPARQL Views" . ; ; a ; "Paper Presentation: Supporting Synchronous Social Q&A Throughout the Question Lifecycle" ; "2011-04-01T11:00:00+05:30" ; "2011-04-01T10:30:00+05:30" ; ; "Paper Presentation: Supporting Synchronous Social Q&A Throughout the Question Lifecycle" . ; ; a ; "Paper Presentation: The Design and Usage of Tentative Events for Time-based Social Coordination in the Enterprise" ; "2011-04-01T11:30:00+05:30" ; "2011-04-01T11:00:00+05:30" ; ; "Paper Presentation: The Design and Usage of Tentative Events for Time-based Social Coordination in the Enterprise" . ; ; a ; "Paper Presentation: A Case for Query by Image and Text Content: Searching Computer Help using Screenshots and Keywords" ; "2011-04-01T12:00:00+05:30" ; "2011-04-01T11:30:00+05:30" ; ; "Paper Presentation: A Case for Query by Image and Text Content: Searching Computer Help using Screenshots and Keywords" . ; ; a ; "Paper Presentation: A Distributed Framework for Reliable and Efficient Service Choreographies" ; "2011-04-01T14:00:00+05:30" ; "2011-04-01T13:30:00+05:30" ; ; "Paper Presentation: A Distributed Framework for Reliable and Efficient Service Choreographies" . ; ; a ; "Paper Presentation: Choreography Conformance via Synchronizability" ; "2011-03-31T15:00:00+05:30" ; "2011-03-31T14:30:00+05:30" ; ; "Paper Presentation: Choreography Conformance via Synchronizability" . ; ; a ; "Paper Presentation: Statically Locating Web Application Bugs Caused by Asynchronous Calls" ; "2011-04-01T15:00:00+05:30" ; "2011-04-01T14:30:00+05:30" ; ; "Paper Presentation: Statically Locating Web Application Bugs Caused by Asynchronous Calls" . ; ; a ; "Paper Presentation: Traffic Characterization and Internet Usage in Rural Africa" ; "2011-03-31T11:00:00+05:30" ; "2011-03-31T10:30:00+05:30" ; ; "Paper Presentation: Traffic Characterization and Internet Usage in Rural Africa" . ; ; a ; "Paper Presentation: Low-Infrastructure Methods to Improve Internet Access for Mobile Users in Emerging Regions" ; "2011-03-31T11:30:00+05:30" ; "2011-03-31T11:00:00+05:30" ; ; "Paper Presentation: Low-Infrastructure Methods to Improve Internet Access for Mobile Users in Emerging Regions" . ; ; a ; "Paper Presentation: Analyzing and Accelerating Web Access in a School in Peri-Urban India" ; "2011-03-31T12:00:00+05:30" ; "2011-03-31T11:30:00+05:30" ; ; "Paper Presentation: Analyzing and Accelerating Web Access in a School in Peri-Urban India" . ; ; a ; "Paper Presentation: The Lwazi Community Communication Service: Design and Piloting of a Voice-Based Information Service" ; "2011-03-31T14:00:00+05:30" ; "2011-03-31T13:30:00+05:30" ; ; "Paper Presentation: The Lwazi Community Communication Service: Design and Piloting of a Voice-Based Information Service" . ; ; a ; "Paper Presentation: Two-Stream Indexing for Spoken Web Search" ; "2011-03-31T14:30:00+05:30" ; "2011-03-31T14:00:00+05:30" ; ; "Paper Presentation: Two-Stream Indexing for Spoken Web Search" . ; ; a ; "Paper Presentation: Assistive Technology for vision-impairments: An agenda for the ICT4D community" ; "2011-03-31T15:00:00+05:30" ; "2011-03-31T14:30:00+05:30" ; ; "Paper Presentation: Assistive Technology for vision-impairments: An agenda for the ICT4D community" . ; ; a ; "Paper Presentation: Design and Implementation of Contextual Information Portals" ; "2011-03-31T16:00:00+05:30" ; "2011-03-31T15:30:00+05:30" ; ; "Paper Presentation: Design and Implementation of Contextual Information Portals" . ; ; a ; "Paper Presentation: Identifying Enrichment Candidates in Textbooks" ; "2011-03-31T16:30:00+05:30" ; "2011-03-31T16:00:00+05:30" ; ; "Paper Presentation: Identifying Enrichment Candidates in Textbooks" . ; ; a ; "Paper Presentation: Location Specific Summarization of Climatic and Agricultural Trends" ; "2011-03-31T17:00:00+05:30" ; "2011-03-31T16:30:00+05:30" ; ; "Paper Presentation: Location Specific Summarization of Climatic and Agricultural Trends" . a ; "H-01" . a ; "H-02" . a ; "H-03-Exhibit Hall" . a ; "H-04-Plenary Hall" . a ; "H-05" . a ; "H-06" . a ; "MR 1-01" . a ; "MR 1-02" . a ; "MR 1-03" . a ; "MR 1-04" . a ; "MR 1-05" . a ; "MR G-01 & G-02" . a ; "MR G-03" . a ; "MR G-03 & G-04" . a ; "MR G-04" . ; ; , , , ; "A Better Uncle for OWL: Nominal Schemas for Integrating Rules and Ontologies" ; ; "We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like \"variable nominal classes\" within axioms. This feature allows ontology languages to express arbitrary DL-safe rules (as expressible in SWRL or RIF) in their native syntax. We show that adding nominal schemas to OWL 2 does not increase the worst-case reasoning complexity, and we identify a novel tractable language SROELV_3 that is versatile enough to capture the lightweight languages OWL EL and OWL RL." ; , , , ; "March/April" ; "645" ; ; "2011" ; a ; "A Better Uncle for OWL: Nominal Schemas for Integrating Rules and Ontologies" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , , ; "A Case for Query by Image and Text Content: Searching Computer Help Using Screenshots and Keywords" ; ; "The multimedia information retrieval community has dedicated extensive research effort to the problem of content-based image retrieval (CBIR). However, these systems find their main limitation in the difficulty of creating pictorial queries. As a result, few systems offer the option of querying by visual examples, and rely on automatic concept detection and tagging techniques to provide support for searching visual content using textual queries.This paper proposes and studies a practical multimodal web search scenario, where CBIR fits intuitively to improve the retrieval of rich information queries. Many online articles contain useful know-how knowledge about computer applications. These articles tend to be richly illustrated by screenshots. We present a system to search for such software know-how articles that leverages the visual correspondences between screenshots. Users can naturally create pictorial queries simply by taking a screenshot of the application to retrieve a list of articles containing a matching screenshot. We build a prototype comprising 150k articles that are classified into walkthrough, book, gallery, and general categories, and provide a comprehensive evaluation of this system, focusing on technical (accuracy of CBIR techniques) and usability (perceived system usefulness) aspects. We also consider the study of added value features of such a visual-supported search, including the ability to perform cross-lingual queries. We find that the system is able to retrieve matching screenshots for a wide variety of programs, across language boundaries, and provide subjectively more useful results than keyword-based web and image search engines." ; , , , , ; "March/April" ; "775" ; ; "2011" ; a ; "A Case for Query by Image and Text Content: Searching Computer Help Using Screenshots and Keywords" ; , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; ; , , ; "A Distributed Framework for Reliable and Efficient Service Choreographies" ; ; "In service-oriented architectures (SOA), independently developed Web services can be dynamically composed. However, the composition is prone to producing semantically conflicting interactions among the services. For example, in an interdepartmental business collaboration through Web services, the decision by the marketing department to clear out the inventory might be inconsistent with the decision by the operations department to increase production. Resolving semantic conflicts is challenging especially when services are loosely coupled and their interactions are not carefully governed. To address this problem, we propose a novel distributed service choreography framework. We deploy safety constraints to prevent conflicting behavior and enforce reliable and efficient service interactions via federated publish/subscribe messaging, along with strategic placement of distributed choreography agents and coordinators to minimize runtime overhead. Experimental results show that our framework prevents semantic conflicts with negligible overhead and scales better than a centralized approach by up to 60%." ; , , ; "March/April" ; "785" ; ; "2011" ; a ; "A Distributed Framework for Reliable and Efficient Service Choreographies" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "A Game Theoretic Formulation of the Service Provisioning Problem in Cloud Systems" ; ; "Cloud computing is an emerging paradigm which allows the on-demand delivering of software, hardware, and data as services. As cloud-based services are more numerous and dynamic, the development of efficient service provisioning policies become increasingly challenging. Game theoretic approaches have shown to gain a thorough analytical understanding of the service provisioning problem. In this paper we take the perspective of Software as a Service (SaaS) providers which host their applications at an Infrastructure as a Service (IaaS) provider. Each SaaS needs to comply with quality of service requirements, specified in Service Level Agreement (SLA) contracts with the end-users, which determine the revenues and penalties on the basis of the achieved performance level. SaaS providers want to maximize their revenues from SLAs, while minimizing the cost of use of resources supplied by the IaaS provider. Moreover, SaaS providers compete and bid for the use of infrastructural resources. On the other hand, the IaaS wants to maximize the revenues obtained providing virtualized resources. In this paper we model the service provisioning problem as a Generalized Nash game, and we propose an efficient algorithm for the run time management and allocation of IaaS resources to competing SaaSs." ; , , ; "March/April" ; "177" ; ; "2011" ; a ; "A Game Theoretic Formulation of the Service Provisioning Problem in Cloud Systems" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "A Self-Training Approach for Resolving Object Coreference on the Semantic Web" ; ; "An object on the Semantic Web is likely to be denoted with multiple URIs by different parties. Object coreference resolution is to identify \"equivalent\" URIs that denote the same object. Driven by the Linking Open Data (LOD) initiative, millions of URIs have been explicitly linked with owl:sameAs statements, but potentially coreferent ones are still considerable. Existing approaches address the problem mainly from two directions: one is based upon equivalence inference mandated by OWL semantics, which finds semantically coreferent URIs but probably omits many potential ones; the other is via similarity computation between property-value pairs, which is not always accurate enough. In this paper, we propose a self-training approach for object coreference resolution on the Semantic Web, which leverages the two classes of approaches to bridge the gap between semantically coreferent URIs and potential candidates. For an object URI, we firstly establish a kernel that consists of semantically coreferent URIs based on owl:sameAs, (inverse) functional properties and (max-)cardinalities, and then extend such kernel iteratively in terms of discriminative property-value pairs in the descriptions of URIs. In particular, the discriminability is learnt with a statistical measurement, which not only exploits key characteristics for representing an object, but also takes into account the matchability between properties from pragmatics. In addition, frequent property combinations are mined to improve the accuracy of the resolution. We implement a scalable system and demonstrate that our approach achieves good precision and recall for resolving object coreference, on both benchmark and large-scale datasets." ; , , ; "March/April" ; "87" ; ; "2011" ; a ; "A Self-Training Approach for Resolving Object Coreference on the Semantic Web" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , , ; "A Stochastic Learning-To-Rank Algorithm and Its Application to Contextual Advertising" ; ; "This paper is concerned with the problem of learning a model to rank objects (Web pages, ads and etc.). We propose a framework where the ranking model is both optimized and evaluated using the same information retrieval measures such as Normalized Discounted Cumulative Gain (NDCG) and Mean Average Precision (MAP). The main difficulty in direct optimization of NDCG and MAP is that these measures depend on the rank of objects and are not differentiable. Most learning-to-rank methods that attempt to optimize NDCG or MAP approximate such measures so that they can be differentiable. In this paper, we propose a simple yet effective stochastic optimization algorithm to directly minimize any loss function, which can be defined on NDCG or MAP for the learning-to-rank problem. The algorithm employs Simulated Annealing along with Simplex method for its parameter search and finds the global optimal parameters. Experiment results using NDCG-Annealing algorithm, an instance of the proposed algorithm, on LETOR benchmark data sets show that the proposed algorithm is both effective and stable when compared to the baselines provided in LETOR 3.0. In addition, we applied the algorithm for ranking ads in contextual advertising. Our method has shown to significantly improve relevance in offline evaluation and business metrics in online tests in a real large-scale advertising serving system. To scale our computations, we parallelize the algorithm in a MapReduce framework running on Hadoop." ; , , , ; "March/April" ; "377" ; ; "2011" ; a ; "A Stochastic Learning-To-Rank Algorithm and Its Application to Contextual Advertising" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , , ; "A Unified Framework for Recommending Diverse and Relevant Queries" ; ; "Query recommendation has been considered as an effective way to help search users in their information seeking activities. Traditional approaches mainly focused on recommending alternative queries with close search intent to the original query. However, to only take relevance into account may generate redundant recommendations to users. It is better to provide diverse as well as relevant query recommendations, so that we can cover multiple potential search intents of users and minimize the risk that users will not be satisfied. Besides, previous query recommendation approaches mostly relied on measuring the relevance or similarity between queries in the Euclidean space. However, there is no convincing evidence that the query space is Euclidean. It is more natural and reasonable to assume that the query space is a manifold. In this paper, therefore, we aim to recommend diverse and relevant queries based on the intrinsic query manifold. We propose a unified model, named manifold ranking with stop points, for query recommendation. By turning ranked queries into stop points on the query manifold, our approach can generate query recommendations by simultaneously considering both diversity and relevance in a unified way. Empirical experimental results on a large scale query log of a commercial search engine show that our approach can effectively generate highly diverse as well as closely related query recommendations." ; , , , , ; "March/April" ; "37" ; ; "2011" ; a ; "A Unified Framework for Recommending Diverse and Relevant Queries" ; , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; ; , , , ; "A Word at a Time: Computing Word Relatedness Using Temporal Semantic Analysis" ; ; "Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to computing semantic relatedness mostly used static language resources, while essentially ignoring their temporal aspects. We believe that a considerable amount of relatedness information can also be found in studying patterns of word usage over time. Consider, for instance, a newspaper archive spanning many years. Two words such as ``war'' and ``peace'' might rarely co-occur in the same articles, yet their patterns of use over time might be similar. In this paper, we propose a new semantic relatedness model, Temporal Semantic Analysis (TSA), which captures this temporal information. The previous state of the art method, Explicit Semantic Analysis (ESA), represented word semantics as a vector of concepts. TSA uses a more refined representation, where each concept is no longer scalar, but is instead represented as time series over a corpus of temporally-ordered documents. To the best of our knowledge, this is the first attempt to incorporate temporal evidence into models of semantic relatedness. Empirical evaluation shows that TSA provides consistent improvements over the state of the art ESA results on multiple benchmarks." ; , , , ; "March/April" ; "337" ; ; "2011" ; a ; "A Word at a Time: Computing Word Relatedness Using Temporal Semantic Analysis" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , ; "Adaptive Policies for Selecting Groupon Style Chunked Reward Ads in a Stochastic Knapsack Framework" ; ; "Stochastic knapsack problems deal with selecting items with potentially random sizes and rewards so as to maximize the total reward while satisfying certain capacity constraints. A novel variant of this problem, where items are worthless unless collected in bundles, is introduced here. This setup is similar to the Groupon model, where a deal is off unless a minimum number of users sign up for it. Since the optimal algorithm to solve this problem is not practical, several adaptive greedy approaches with reasonable time and memory requirements are studied in detail -- theoretically, as well as, experimentally. Worst case performance guarantees are provided for some of these greedy algorithms, while results of experimental evaluation demonstrate that they are much closer to optimal than what the theoretical bounds suggest. Applications include optimizing for online advertising pricing models where advertisers pay only when certain goals, in terms of clicks or conversions, are met. We perform extensive experiments for the situation where there are between two and five ads. For typical ad conversion rates, the greedy policy of selecting items having the highest individual expected reward obtains a value within 5% of optimal over 95% of the time for a wide selection of parameters." ; , , , ; "March/April" ; "167" ; ; "2011" ; a ; "Adaptive Policies for Selecting Groupon Style Chunked Reward Ads in a Stochastic Knapsack Framework" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , ; "Addressing People's Information Needs Directly in a Web Search Result Page" ; ; "Web search engines have historically focused on connecting people with information resources. For example, if a person wanted to know when their flight to Hyderabad was leaving, a search engine might connect them with the airline where they could find flight status information. However, search engines have recently begun to try to meet people s search needs directly, providing, for example, flight status information in response to queries that include an airline and a flight number. In this paper, we use large scale query log analysis to explore the challenges a search engine faces when trying to meet an information need directly in the search result page. We look at how people's interaction behavior changes when inline content is returned, finding that such content can cannibalize clicks from the algorithmic results. We see that in the absence of interaction behavior, an individual's repeat search behavior can be useful in understanding the content's value. We also discuss some of the ways user behavior can be used to provide insight into when inline answers might better trigger and what types of additional information might be included in the results." ; , ; "March/April" ; "27" ; ; "2011" ; a ; "Addressing People's Information Needs Directly in a Web Search Result Page" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , , ; "An Expressive Mechanism for Auctions on the Web" ; ; "Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-item auctions with unit demand. The main drawback of standard mechanisms for this type of auctions, such as VCG and GSP, is the limited expressiveness that they offer to the bidders. The General Auction Mechanism (GAM) of Aggarwal et al. (2009) is taking a first step towards addressing the problem of limited expressiveness by computing a bidder optimal, envy free outcome for linear utility functions with identical slopes and a single discontinuity per bidder-item pair. We show that in many practical situations this does not suffice to adequately model the preferences of the bidders, and we overcome this problem by presenting the first mechanism for piece-wise linear utility functions with non-identical slopes and multiple discontinuities. Our mechanism runs in polynomial time. Like GAM it is incentive compatible for inputs that fulfill a certain non-degeneracy requirement, but our requirement is more general than the requirement of GAM. For discontinuous utility functions that are non-degenerate as well as for continuous utility functions the outcome of our mechanism is a competitive equilibrium. We also show how our mechanism can be used to compute approximately bidder optimal, envy free outcomes for a general class of continuous utility functions via piece-wise linear approximation. Finally, we prove hardness results for even more expressive settings." ; , , ; "March/April" ; "127" ; ; "2011" ; a ; "An Expressive Mechanism for Auctions on the Web" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , , ; "ARROW: GenerAting SignatuRes to Detect DRive-By DOWnloads" ; ; "A drive-by download attack occurs when a user visits a webpage which attempts to automatically download malware without the user's consent. Attackers sometimes use a malware distribution network (MDN) to manage a large number of malicious webpages, exploits, and malware executables. In this paper, we provide a new method to determine these MDNs from the secondary URLs and redirect chains recorded by a high-interaction client honeypot. In addition, we propose a novel drive-by download detection method. Instead of depending on the malicious content used by previous methods, our algorithm first identifies and then leverages the URLs of the MDN's central servers, where a central server is a common server shared by a large percentage of the drive-by download attacks in the same MDN. A set of regular expression-based signatures are then generated based on the URLs of each central server. This method allows additional malicious webpages to be identified which launched but failed to execute a successful drive-by download attack. The new drive-by detection system named ARROW has been implemented, and we provide a large-scale evaluation on the output of a production drive-by detection system. The experimental results demonstrate the effectiveness of our method, where the detection coverage has been boosted by 96% with an extremely low false positive rate." ; , , , ; "March/April" ; "187" ; ; "2011" ; a ; "ARROW: GenerAting SignatuRes to Detect DRive-By DOWnloads" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , ; "Automatic Construction of a Context-Aware Sentiment Lexicon: An Optimization Approach" ; ; "The explosion of Web opinion data has made essential the need for automatic tools to analyze and understand people's sentiments toward different topics. In most sentiment analysis applications, the sentiment lexicon plays a central role. However, it is well known that there is no universally optimal sentiment lexicon since the polarity of words is sensitive to the topic domain. Even worse, in the same domain the same word may indicate different polarities with respect to different aspects. For example, in a laptop review, ``large'' is negative for the battery aspect while being positive for the screen aspect. In this paper, we focus on the problem of learning a sentiment lexicon that is not only domain specific but also dependent on the aspect in context given an unlabeled opinionated text collection. We propose a novel optimization framework that provides a unified and principled way to combine different sources of information for learning such a context-dependent sentiment lexicon. Experiments on two data sets (hotel reviews and customer feedback surveys on printers) show that our approach can not only identify new sentiment words specific to the given domain but also determine the different polarities of a word depending on the aspect in context. In further quantitative evaluation, our method is proved to be effective in constructing a high quality lexicon by comparing with a human annotated gold standard. In addition, using the learned context-dependent sentiment lexicon improved the accuracy in an aspect-level sentiment classification task." ; , , , ; "March/April" ; "347" ; ; "2011" ; a ; "Automatic Construction of a Context-Aware Sentiment Lexicon: An Optimization Approach" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , ; "Buy-It-Now or Take-a-Chance: A Simple Sequential Screening Mechanism" ; ; "We present a simple auction mechanism which extends the second-price auction with reserve and is truthful in expectation. This mechanism is particularly effective in private value environments where the distribution of valuations are irregular. Bidders can \"buy-it-now\", or alternatively \"take-a-chance\" where the top d bidders are equally likely to win. The randomized take-a-chance allocation incentivizes high valuation bidders to buy-it-now. We show that for a large class of valuations, this mechanism achieves similar allocations and revenues as Myerson's optimal mechanism, and outperforms the second-price auction with reserve. In addition, we present an evaluation of bid data from Microsoft's AdECN platform. We find the valuations are irregular, and counterfactual experiments suggest our BIN-TAC mechanism would improve revenue by 11% relative to an optimal second-price mechanism with reserve." ; , , , ; "March/April" ; "147" ; ; "2011" ; a ; "Buy-It-Now or Take-a-Chance: A Simple Sequential Screening Mechanism" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , , ; "Characterizing Search Intent Diversity into Click Models" ; ; "Modeling a user's click-through behavior in click logs is a challenging task due to the well-known position bias problem. Recent advances in click models have adopted the examination hypothesis which distinguishes document relevance from position bias. In this paper, we revisit the examination hypothesis and observe that user clicks cannot be completely explained by relevance and position bias. Specifically, users with different search intents may submit the same query to the search engine but expect different search results. Thus, there might be a bias between user search intent and the query formulated by the user, which can lead to the diversity in user clicks. This bias has not been considered in previous works such as UBM, DBN and CCM. In this paper, we propose a new intent hypothesis as a complement to the examination hypothesis. This hypothesis is used to characterize the bias between the user search intent and the query in each search session. This hypothesis is very general and can be applied to most of the existing click models to improve their capacities in learning unbiased relevance. Experimental results demonstrate that after adopting the intent hypothesis, click models can better interpret user clicks and achieve a significant NDCG improvement." ; , , , , ; "March/April" ; "17" ; ; "2011" ; a ; "Characterizing Search Intent Diversity into Click Models" ; , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; ; , ; "Choreography Conformance via Synchronizability" ; ; "Choreography analysis has been a crucial problem in service oriented computing. Interactions among services involve message exchanges across organizational boundaries in a distributed computing environment, and in order to build such systems in a reliable manner, it is necessary to develop techniques for analyzing such interactions. Choreography conformance involves verifying that a set of services behave according to a given choreography specification that characterizes their interactions. Unfortunately this is an undecidable problem when services interact with asynchronous communication. In this paper we present techniques that identify if the interaction behavior for a set of services remain the same when asynchronous communication is replaced with synchronous communication. This is called the synchronizability problem and determining the synchronizability of a set of services has been an open problem for several years. We solve this problem in this paper. Our results can be used to identify synchronizable services for which choreography conformance can be checked efficiently. Our results on synchronizability are applicable to any software infrastructure that supports message-based interactions." ; , ; "March/April" ; "795" ; ; "2011" ; a ; "Choreography Conformance via Synchronizability" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , , ; "Consideration Set Generation in Commerce Search" ; ; "In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of products is known as the consideration set. In this study, we consider the problem of generating consideration set of products in commerce search so as to maximize user satisfaction. One of the key features of commerce search that we exploit in our study is the association of a set of important attributes with the products and a set of specified attributes with the user queries. Those important attributes not used in the query are treated as unspecified. The attribute space admits a natural definition of user satisfaction via user preferences on the attributes and their values, viz. require that the surfaced products be close to the specified attribute values in the query, and diverse with respect to the unspecified attributes. We model this as a general Max-Sum Dispersion problem wherein we are given a set of n nodes in a metric space and the objective is to select a subset of nodes with total cost at most a given budget, and maximize the sum of the pairwise distances between the selected nodes. In our setting, each node denotes a product, the cost of a node being inversely proportional to its relevance with respect to specified attributes. The distance between two nodes quantifies the diversity with respect to the unspecified attributes. The problem is NP-hard and a 2-approximation was previously known only when all the nodes have unit cost. In our setting, we do not make any assumptions on the cost. We label this problem as the General Max-Sum Dispersion problem. We give the first constant factor approximation algorithm for this problem, achieving an approximation ratio of 2. Further, we perform extensive empirical analysis on real-world data to show the effectiveness of our algorithm." ; , , ; "March/April" ; "317" ; ; "2011" ; a ; "Consideration Set Generation in Commerce Search" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , ; "Context-Sensitive Query Auto-Completion" ; ; "Query auto completion is known to provide poor predictions of the user's query when her input prefix is very short (e.g., one or two characters). In this paper we show that context, such as the user's recent queries, can be used to improve the prediction quality considerably even for such short prefixes. We propose a context-sensitive query auto completion algorithm, NearestCompletion, which outputs the completions of the user's input that are most similar to the context queries. To measure similarity, we represent queries and contexts as high-dimensional term-weighted vectors and resort to cosine similarity. The mapping from queries to vectors is done through a new query expansion technique that we introduce, which expands a query by traversing the query recommendation tree rooted at the query. In order to evaluate our approach, we performed extensive experimentation over the public AOL query log. We demonstrate that when the recent user's queries are relevant to the current query she is typing, then after typing a single character, NearestCompletion's MRR is 48% higher relative to the MRR of the standard MostPopularCompletion algorithm on average. When the context is irrelevant, however, NearestCompletion's MRR is essentially zero. To mitigate this problem, we propose HybridCompletion, which is a hybrid of NearestCompletion with MostPopularCompletion. HybridCompletion is shown to dominate both NearestCompletion and MostPopularCompletion, achieving a total improvement of 31.5% in MRR relative to MostPopularCompletion on average." ; , ; "March/April" ; "107" ; ; "2011" ; a ; "Context-Sensitive Query Auto-Completion" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , ; "Counting Triangles and the Curse of the Last Reducer" ; ; "The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduced to counting the number of triangles incident on the particular node in the network. In case the graph is too big to fit into memory, this is a non-trivial task, and previous researchers showed how to estimate the clustering coefficient in this scenario. A different avenue of research is to to perform the computation in parallel, spreading it across many machines. In recent years MapReduce has emerged as a de facto programming paradigm for parallel computation on massive data sets. The main focus of this work is to give MapReduce algorithms for counting triangles which we use to compute clustering coefficients. Our contributions are twofold. First, we describe a sequential triangle counting algorithm and show how to adapt it to the MapReduce setting. This algorithm achieves a factor of 10-100 speed up over the naive approach. Second, we present a new algorithm designed specifically for the MapReduce framework. A key feature of this approach is that it allows for a smooth tradeoff between the memory available on each individual machine and the total memory available to the algorithm, while keeping the total work done constant. Moreover, this algorithm can use any triangle counting algorithm as a black box and distribute the computation across many machines. We validate our algorithms on real world datasets comprising of millions of nodes and over a billion edges. Our results show both algorithms effectively deal with skew in the degree distribution and lead to dramatic speed ups over the naive implementation." ; , ; "March/April" ; "607" ; ; "2011" ; a ; "Counting Triangles and the Curse of the Last Reducer" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , , ; "Differences in the Mechanics of Information Diffusion Across Topics: Idioms, Political Hashtags, and Complex Contagion on Twitter" ; ; "There is a widespread intuitive sense that different kinds of information spread differently on-line, but it has been difficult to evaluate this question quantitatively since it requires a setting where many different kinds of information spread in a shared environment. Here we study this issue on Twitter, analyzing the ways in which tokens known as hashtags spread on a network defined by the interactions among Twitter users. We find significant variation in the ways that widely-used hashtags on different topics spread. Our results show that this variation is not attributable simply to differences in stickiness, the probability of adoption based on one or more exposures, but also to a quantity that could be viewed as a kind of persistence the relative extent to which repeated exposures to a hashtag continue to have significant marginal effects. We find that hashtags on politically controversial topics are particularly persistent, with repeated exposures continuing to have unusually large marginal effects on adoption; this provides, to our knowledge, the first large-scale validation of the complex contagion principle from sociology, which posits that repeated exposures to an idea are particularly crucial when the idea is in some way controversial or contentious. Among other findings, we discover that hashtags representing the natural analogues of Twitter idioms and neologisms are particularly non-persistent, with the effect of multiple exposures decaying rapidly relative to the first exposure. We also study the subgraph structure of the initial adopters for different widely-adopted hashtags, again finding structural differences across topics. We develop simulation-based and generative models to analyze how the adoption dynamics interact with the network structure of the early adopters on which a hashtag spreads." ; , , ; "March/April" ; "695" ; ; "2011" ; a ; "Differences in the Mechanics of Information Diffusion Across Topics: Idioms, Political Hashtags, and Complex Contagion on Twitter" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "Dynamics of Bidding in A P2P Lending Service: Effects of Herding and Predicting Loan Success" ; ; "Online peer-to-peer (P2P) lending services are a new type of social platform that enables individuals borrow and lend money directly from one to another. In this paper, we study the dynamics of bid- ding behavior in a P2P loan auction website, Prosper.com. We investigate the change of various attributes of loan requesting listings over time, such as the interest rate and the number of bids. We ob- serve that there is herding behavior during bidding, and for most of the listings, the numbers of bids they receive reach spikes at very similar time points. We explain these phenomena by showing that there are economic and social factors that lenders take into account when deciding to bid on a listing.We also observe that the profits the lenders make are tied with their bidding preferences. Finally, we build a model based on the temporal progression of the bidding, that reliably predicts the success of a loan request listing, as well as whether a loan will be paid back or not." ; , , ; "March/April" ; "547" ; ; "2011" ; a ; "Dynamics of Bidding in A P2P Lending Service: Effects of Herding and Predicting Loan Success" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "Efficient K-Nearest Neighbor Graph Construction for Generic Similarity Measures" ; ; "K-Nearest Neighbor Graph (K-NNG) construction is an important operation with many web related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Existing methods for K-NNG construction either do not scale, or are specific to certain similarity measures. We present NN-Descent, a simple yet efficient algorithm for approximate K-NNG construction with arbitrary similarity measures. Our method is based on local search, has minimal space overhead and does not rely on any shared global index. Hence, it is especially suitable for large-scale applications where data structures need to be distributed over the network. We have shown with a variety of datasets and similarity measures that the proposed method typically converges to above 90% recall with each point comparing only to several percent of the whole dataset on average." ; , , ; "March/April" ; "577" ; ; "2011" ; a ; "Efficient K-Nearest Neighbor Graph Construction for Generic Similarity Measures" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , , , , , ; "Efficiently Evaluating Graph Constraints in Content-Based Publish/Subscribe" ; ; "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." ; , , , , , , ; "March/April" ; "497" ; ; "2011" ; a ; "Efficiently Evaluating Graph Constraints in Content-Based Publish/Subscribe" ; , , , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; rdf:_7 ; a rdf:Seq . ; ; , , , ; "EP-SPARQL: A Unified Language for Event Processing and Stream Reasoning" ; ; "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." ; , , , ; "March/April" ; "635" ; ; "2011" ; a ; "EP-SPARQL: A Unified Language for Event Processing and Stream Reasoning" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , ; "Estimating Sizes of Social Networks via Biased Sampling" ; ; "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." ; , , ; "March/April" ; "597" ; ; "2011" ; a ; "Estimating Sizes of Social Networks via Biased Sampling" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "Evaluating New Search Engine Configurations with Pre-Existing Judgments and Clicks" ; ; "We provide a novel method of evaluating search results, which allows us to combine existing editorial judgments with the relevance estimates generated by click-based user browsing models. There are evaluation methods in the literature that use clicks and editorial judgments together, but our approach is novel in the sense that it allows us to predict the impact of unseen search models without online tests to collect clicks and without requesting new editorial data, since we are only re-using existing editorial data, and clicks observed for previous result set configurations. Since the user browsing model and the pre-existing editorial data cannot provide relevance estimates for all documents for the selected set of queries, one important challenge is to obtain this performance estimation where there are a lot of ranked documents with missing relevance values. We introduce a query and rank based smoothing to overcome this problem. We show that a hybrid of these smoothing techniques performs better than both query and position based smoothing, and despite the high percentage of missing judgments, the resulting method is significantly correlated (0.74) with DCG values evaluated using fully judged datasets, and approaches inter-annotator agreement. We show that previously published techniques, applicable to frequent queries, degrade when applied to a random sample of queries, with a correlation of only 0.29. While our experiments focus on evaluation using DCG, our method is also applicable to other commonly used metrics." ; , , ; "March/April" ; "397" ; ; "2011" ; a ; "Evaluating New Search Engine Configurations with Pre-Existing Judgments and Clicks" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "FACTO: A Fact Lookup Engine Based on Web Tables" ; ; "Recently answers for fact lookup queries have appeared on major search engines. For example, for the query {Barack Obama date of birth} Google directly shows 4 August 1961 above its regular results. In this paper, we describe FACTO, an end-to-end system for answering fact lookup queries for web search. FACTO extracts structured data from tables on the web, aggregates and cleans such data and stores them in a database. Given a web search query, FACTO will decide if it asks for facts in this database, and provides the most confident answer when possible. FACTO achieves higher precision and comparable coverage comparing with the fact lookup engines by Google and Ask.com, although FACTO is developed by a very small team. We present the challenges and our solutions in developing every component of FACTO. Some solutions are based on existing technologies, and many others are novel approaches proposed by us." ; , , ; "March/April" ; "507" ; ; "2011" ; a ; "FACTO: A Fact Lookup Engine Based on Web Tables" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , , , ; "Finding Hierarchy in Directed Online Social Networks" ; ; "Social hierarchy and stratification among humans is a well studied concept in sociology. The popularity of online social networks presents an opportunity to study social hierarchy for different types of networks and at different scales. We adopt the premise that people form connections in a social network based on their perceived social hierarchy; as a result, the edge directions in directed social networks can be leveraged to infer hierarchy. In this paper, we de fine a measure of hierarchy in a directed online social network, and present an efficient algorithm to compute this measure. We validate our measure using ground truth including Wikipedia notability score. We use this measure to study hierarchy in several directed online social networks including Twitter, Delicious, YouTube, Flickr, LiveJournal, and curated lists of several categories of people based on different occupations, and different organizations. Our experiments on different online social networks show how hierarchy emerges as we increase the size of the network. This is in contrast to random graphs, where the hierarchy decreases as the network size increases. Further, we show that the degree of stratification in a network increases very slowly as we increase the size of the graph." ; , , , , ; "March/April" ; "557" ; ; "2011" ; a ; "Finding Hierarchy in Directed Online Social Networks" ; , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; ; , ; "Finding the Bias and Prestige of Nodes in Networks based on Trust Scores" ; ; "Many real-life graphs such as social networks and peer-to-peer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such networks includes trust prediction, finding the most reliable or trusted node in a local subgraph, etc. For many of these applications, it is crucial to assess the prestige and bias of a node. The bias of a node denotes its propensity to trust/mistrust its neighbours and is closely related to truthfulness. If a node trusts all its neighbours, its recommendation of another node as trustworthy is less reliable. It is based on the idea that the recommendation of a highly biased node should weigh less. In this paper, we propose an algorithm to compute the bias and prestige of nodes in networks where the edge weight denotes the trust score. Unlike most other graph-based algorithms, our method works even when the edge weights are not necessarily positive. The algorithm is iterative and runs in O(km) time where k is the number of iterations and m is the total number of edges in the network. The algorithm exhibits several other desirable properties. It converges to a unique value very quickly. Also, the error in bias and prestige values at any particular iteration is bounded. Further, experiments show that our model conforms well to social theories such as the balance theory (enemy of a friend is an enemy, etc.)." ; , ; "March/April" ; "567" ; ; "2011" ; a ; "Finding the Bias and Prestige of Nodes in Networks based on Trust Scores" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , , , , ; "Generalized Link Suggestions Via Web Site Clustering" ; ; "Proactive link suggestion leads to improved user experience by allowing users to reach relevant information with fewer clicks, fewer pages to read, or simply faster because the right pages are prefetched just in time. In this paper we tackle two new scenarios for link suggestion, which were not covered in prior work owing to scarcity of historical browsing data. In the web search scenario, we propose a method for generating quick links---additional entry points into Web sites, which are shown for top search results for navigational queries - for tail sites, for which little browsing statistics is available. Beyond Web search, we also propose a method for link suggestion in general web browsing, effectively anticipating the next link to be followed by the user. Our approach performs clustering of Web sites in order to aggregate information across multiple sites, and enables relevant link suggestion for virtually any site, including tail sites and brand new sites for which little historical data is available. Empirical evaluation confirms the validity of our method using editorially labeled data as well as real-life search and browsing data from a major US search engine." ; , , , , ; "March/April" ; "77" ; ; "2011" ; a ; "Generalized Link Suggestions Via Web Site Clustering" ; , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; ; , , , , ; "Geographical Topic Discovery and Comparison" ; ; "This paper studies the problem of discovering and comparing geographical topics from GPS-associated documents. GPS-associated documents become popular with the pervasiveness of location-acquisition technologies. For example, in Flickr, the geo-tagged photos are associated with tags and GPS locations. In Twitter, the locations of the tweets can be identified by the GPS locations from smart phones. Many interesting concepts, including cultures, scenes, and product sales, correspond to specialized geographical distributions. In this paper, we are interested in two questions: (1) how to discover different topics of interests that are coherent in geographical regions? (2) how to compare several topics across different geographical locations? To answer these questions, this paper proposes and compares three ways of modeling geographical topics: location-driven model, text-driven model, and a novel joint model called LGTA (Latent Geographical Topic Analysis) that combines location and text. To make a fair comparison, we collect several representative datasets from Flickr website including Landscape, Activity, Manhattan, National park, Festival, Car, and Food. The results show that the first two methods work in some datasets but fail in others. LGTA works well in all these datasets at not only finding regions of interests but also providing effective comparisons of the topics across different locations. The results confirm our hypothesis that the geographical distributions can help modeling topics, while topics provide important cues to group different geographical regions." ; , , , , ; "March/April" ; "247" ; ; "2011" ; a ; "Geographical Topic Discovery and Comparison" ; , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; ; , , , , ; "Heat-Seeking Honeypots: Design and Experience" ; ; "Many malicious activities on the Web today make use of compromised Web servers, because these servers often have high pageranks and provide free resources. Attackers are therefore constantly searching for vulnerable servers. In this work, we aim to understand how attackers find, compromise, and misuse vulnerable servers. Specifically, we present heat-seeking honeypots that actively attract attackers, dynamically generate and deploy honeypot pages, then analyze logs to identify attack patterns. Over a period of three months, our deployed honeypots, despite their obscure location on a university network, attracted more than 44,000 attacker visits from close to 6,000 distinct IP addresses. By analyzing these visits, we characterize attacker behavior and develop simple techniques to identify attack traffic. Applying these techniques to more than 100 regular Web servers as an example, we identified malicious queries in almost all of their logs." ; , , , , ; "March/April" ; "207" ; ; "2011" ; a ; "Heat-Seeking Honeypots: Design and Experience" ; , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; ; , , ; "Here, There, and Everywhere: Correlated Online Behaviors Can Lead to Overestimates of the Effects of Advertising" ; ; "Measuring the causal effects of online advertising (adfx) on user behavior is important to the health of the WWW publishing industry. In this paper, using three controlled experiments, we show that observational data frequently lead to incorrect estimates of adfx. The reason, which we label \"activity bias,\" comes from the surprising amount of time-based correlation between the myriad activities that users undertake online. In Experiment 1, users who are exposed to an ad on a given day are much more likely to engage in brand-relevant search queries as compared to their recent history for reasons that had nothing do with the advertisement. In Experiment 2, we show that activity bias occurs for page views across diverse websites. In Experiment 3, we track account sign-ups at a competitor s (of the advertiser) website and find that many more people sign-up on the day they saw an advertisement than on other days, but that the true \"competitive effect\" was minimal. In all three experiments, exposure to a campaign signals doing \"more of everything\" in given period of time, making it difficult to find a suitable matched control using prior behavior. In such cases, the \"match\" is fundamentally different from the exposed group, and we show how and why observational methods lead to a massive overestimate of adfx in such circumstances." ; , , ; "March/April" ; "157" ; ; "2011" ; a ; "Here, There, and Everywhere: Correlated Online Behaviors Can Lead to Overestimates of the Effects of Advertising" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "Highly Efficient Algorithms for Structural Clustering of Large Websites" ; ; "In this paper, we present a highly scalable algorithm for structurally clustering webpages for extraction. We show that, using only the URLs of the webpages and simple content features, it is possible to cluster webpages effectively and efficiently. At the heart of our techniques is a principled framework, based on the principles of information theory, that allows us to effectively leverage the URLs, and combine them with content and structural properties. Using an extensive evaluation over several large full websites, we demonstrate the effectiveness of our techniques, at a scale unattainable by previous techniques." ; , , ; "March/April" ; "437" ; ; "2011" ; a ; "Highly Efficient Algorithms for Structural Clustering of Large Websites" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget" ; ; "The neighbourhood function N(t) of a graph G gives, for each t, the number of pairs of nodes such that y is reachable from x in less that t hops. The neighbourhood function provides a wealth of information about the graph (e.g., it easily allows one to compute its diameter), but it is very expensive to compute it exactly. Recently, the ANF algorithm (approximate neighbourhood function) has been proposed with the purpose of approximating N(t) on large graphs. We describe a breakthrough improvement over ANF in terms of speed and scalability. Our algorithm, called HyperANF, uses the new HyperLogLog counters and combines them efficiently through broadword programming; our implementation uses overdecomposition to exploit multi-core parallelism. With HyperANF, for the first time we can compute in a few hours the neighbourhood function of graphs with billions of nodes with a small error and good confidence using a standard workstation. Then, we turn to the study of the distribution of the shortest paths between reachable nodes (that can be efficiently approximated by means of HyperANF), and discover the surprising fact that its index of dispersion provides a clear-cut characterisation of proper social networks vs. web graphs. We thus propose the spid (Shortest-Paths Index of Dispersion) of a graph as a new, informative statistics that is able to discriminate between the above two types of graphs. We believe this is the first proposal of a significant new non-local structural index for complex networks whose computation is highly scalable." ; , , ; "March/April" ; "625" ; ; "2011" ; a ; "HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "Improving Recommendation for Long-Tail Queries Via Templates" ; ; "The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as query recommendation, correction, etc. Yet, no matter how much data is aggregated, the long-tail distribution implies that a large fraction of queries are rare. As a result, most query assistance services perform poorly or are not even triggered on long-tail queries. We propose a method to extend the reach of query assistance techniques (and in particular query recommendation) to long-tail queries by reasoning about rules between query templates rather than individual query transitions, as currently done in query-flow graph models. As a simple example, if we recognize that `Montezuma' is a city in the rare query Montezuma surf and if the rule surf{ beach} has been observed, we are able to offer Montezuma beach as a recommendation, even if the two queries were never observed in a same session. We conducted experiments to validate our hypothesis, first via traditional small-scale editorial assessments but more interestingly via a novel automated large scale evaluation methodology. Our experiments show that general coverage can be relatively increased by 24\\% using templates without penalizing quality. Furthermore, for 36\\% of the 95M queries in our query flow graph, which have no out edges and thus could not be served recommendations, we can now offer at least one recommendation in 98\\% of the cases." ; , , ; "March/April" ; "47" ; ; "2011" ; a ; "Improving Recommendation for Long-Tail Queries Via Templates" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , ; "Incentivizing High-Quality User-Generated Content" ; ; "We model the economics of incentivizing high-quality user generated content (UGC), motivated by settings such as online review forums, question-answer sites, and comments on news articles and blogs. We provide a game-theoretic model within which to study the problem of incentivizing high quality UGC, in which contributors are strategic and motivated by exposure. Our model has the feature that both the quality of contributions as well as the extent of participation is determined endogenously in a free-entry Nash equilibrium. The model predicts, as observed in practice, that if exposure is independent of quality, there will be a flood of low quality contributions in equilibrium. An ideal mechanism in this context would elicit both high quality and high participation in equilibrium, with near-optimal quality as the available attention diverges, and should be easily implementable in practice. We consider a very simple elimination mechanism, which subjects each contribution to rating by some number A of viewers, and eliminates any contributions that are not uniformly rated positively. We construct and analyze free-entry Nash equilibria for this mechanism, and show that A can be chosen to achieve quality that tends to optimal, along with diverging participation, as the number of viewers diverges." ; , ; "March/April" ; "137" ; ; "2011" ; a ; "Incentivizing High-Quality User-Generated Content" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , , ; "Information Credibility on Twitter" ; ; "We analyze the information credibility of news propagated through Twitter, a popular microblogging service. Previous research has shown that most of the messages posted on Twitter are truthful, but the service is also used to spread misinformation and false rumors, often unintentionally. On this paper we focus on automatic methods for assessing the credibility of a given set of tweets. Specifically, we analyze microblog postings related to \"trending\" topics, and classify them as credible or not credible, based on features extracted from them. We use features from users' posting and re-posting (\"re-tweeting\") behavior, from the text of the posts, and from citations to external sources. We evaluate our methods using a significant number of human assessments about the credibility of items on a recent sample of Twitter postings. Our results shows that there are measurable differences in the way messages propagate, that can be used to classify them automatically as credible or not credible, with precision and recall in the range of 70% to 80%." ; , , ; "March/April" ; "675" ; ; "2011" ; a ; "Information Credibility on Twitter" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , , , , ; "Information Spreading in Context" ; ; "Information spreading processes are central to human interactions. Despite recent studies in online domains, little is known about factors that could affect the dissemination of a single piece of information. In this paper, we address this challenge by combining two related but distinct datasets, collected from a large scale privacy-preserving distributed social sensor system. We find that the social and organizational context significantly impacts to whom and how fast people forward information. Yet the structures within spreading processes can be well captured by a simple stochastic branching model, indicating surprising independence of context. Our results build the foundation of future predictive models of information flow and provide significant insights towards design of communication platforms." ; , , , , , ; "March/April" ; "735" ; ; "2011" ; a ; "Information Spreading in Context" ; , , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; ; , , , ; "Inverted Index Compression via Online Document Routing" ; ; "Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due to the sheer size of their indexes, search engines distribute the crawled documents among thousands of servers in a scheme called local index-partitioning, such that each server indexes only several million pages. To ensure documents from the same host (e.g., www.nytimes.com) are distributed uniformly over the servers, for load balancing purposes, random routing of documents to servers is common. To expedite the time documents become searchable after being crawled, documents may be simply appended to the existing index partitions. However, indexing by merely appending documents, results in larger index sizes since document reordering for index compactness is no longer performed. This, in turn, degrades search query processing performance which depends heavily on index sizes. A possible way to balance quick document indexing with efficient query processing, is to deploy online document routing strategies that are designed to reduce index sizes. This work considers the effects of several online document routing strategies on the aggregated partitioned index size. We show that there exists a tradeoff between the compression of a partitioned index and the distribution of documents from the same host across the index partitions (i.e., host distribution). We suggest and evaluate several online routing strategies with regard to their compression, host distribution, and complexity. In particular, we present a term based routing algorithm which is shown analytically to provide better compression results than the industry standard random routing scheme. In addition, our algorithm demonstrates comparable compression performance and host distribution while having much better running time complexity than other document routing heuristics. Our findings are validated by experimental evaluation performed on a large benchmark collection of Web pages." ; , , , ; "March/April" ; "487" ; ; "2011" ; a ; "Inverted Index Compression via Online Document Routing" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , ; "Layered Label Propagation: A Multiresolution Coordinate-Free Ordering for Compressing Social Networks" ; ; "We continue the line of research on graph compression started with WebGraph, but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the approaches that have been used for a long time to compress web graphs rely on a specific ordering of the nodes (lexicographical URL ordering) whose extension to general social networks is not trivial. In this paper, we propose a solution that mixes clusterings and orders, and devise a new algorithm, called Layered Label Propagation, that builds on previous work on scalable clustering and can be used to reorder very large graphs (billions of nodes). Our implementation uses task decomposition to perform aggressively on multi-core architecture, making it possible to reorder graphs of more than 600 millions nodes in a few hours. Experiments performed on a wide array of web graphs and social networks show that combining the order produced by the proposed algorithm with the WebGraph compression framework provides a major increase in compression with respect to all currently known techniques, both on web graphs and on social networks. These improvements make it possible to analyse in main memory significantly larger graphs." ; , , , ; "March/April" ; "587" ; ; "2011" ; a ; "Layered Label Propagation: A Multiresolution Coordinate-Free Ordering for Compressing Social Networks" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , , , ; "Learning to Model Relatedness for News Recommendation" ; ; "With the explosive growth of online news readership, recommending interesting news articles to users has become extremely important. While existing Web services such as Yahoo! and Digg attract users' initial clicks by leveraging various kinds of signals, how to engage such users algorithmically after their initial visit is largely under-explored. In this paper, we study the problem of post-click news recommendation. Given that a user has perused a current news article, our idea is to automatically identify ``related\" news articles which the user would like to read afterwards. Specifically, we propose to characterize relatedness between news articles across four aspects: relevance, novelty, connection clarity, and transition smoothness. Motivated by this understanding, we define a set of features to capture each of these aspects and put forward a learning approach to model relatedness. In order to quantitatively evaluate our proposed measures and learn a unified relatedness function, we construct a large test collection based on a four-month commercial news corpus with editorial judgments. The experimental results show that the proposed heuristics can indeed capture relatedness, and that the learned unified relatedness function works quite effectively." ; , , , , , ; "March/April" ; "57" ; ; "2011" ; a ; "Learning to Model Relatedness for News Recommendation" ; , , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; ; , , ; "Learning to Rank with Multiple Objective Functions" ; ; "We investigate the problem of learning to rank with document retrieval from the perspective of learning for multiple objective functions. We present solutions to two open problems in learning to rank: first, we show how multiple measures can be combined into a single graded measure that can be learned. This solves the problem of learning from a scorecard of measures by making such scorecards comparable, and we show results where a standard web relevance measure (NDCG) is used for the top-tier measure, and a relevance measure derived from click data is used for the second-tier measure; the second-tier measure is shown to significantly improve while leaving the top-tier measure largely unchanged. Second, we note that the learning-to-rank problem can itself be viewed as changing as the ranking model learns: for example, early in learning, adjusting the rank of all documents can be advantageous, but later during training, it becomes more desirable to concentrate on correcting the top few documents for each query. We show how an analysis of these problems leads to an improved, iteration-dependent cost function that interpolates between a cost function that is more appropriate for early learning, with one that is more appropriate for late-stage learning. The approach results in a significant improvement in accuracy with the same size models. We investigate these ideas using LambdaMART, a state-of-the-art ranking algorithm." ; , , ; "March/April" ; "367" ; ; "2011" ; a ; "Learning to Rank with Multiple Objective Functions" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , ; "Learning to Re-Rank: Query-Dependent Image Re-Ranking Using Click Data" ; ; "Our objective is to improve the performance of keyword based image search engines by re-ranking their original results. To this end, we address three limitations of existing search engines in this paper. First, there is no straight-forward, fully automated way of going from textual queries to visual features. Image search engines therefore primarily rely on static and textual features for ranking. Visual features are mainly used for secondary tasks such as finding similar images. Second, image rankers are trained on query-image pairs labeled with relevance judgments determined by human experts. Such labels are well known to be noisy due to various factors including ambiguous queries, unknown user intent and subjectivity in human judgments. This leads to learning a sub-optimal ranker. Finally, a static ranker is typically built to handle disparate user queries. The ranker is therefore unable to adapt its parameters to suit the query at hand which again leads to sub-optimal results. We demonstrate that all of these problems can be mitigated by employing a re-ranking algorithm that leverages aggregate user click data. We hypothesize that images clicked in response to a query are mostly relevant to the query. We therefore re-rank the original search results so as to promote images that are likely to be clicked to the top of the ranked list. Our re-ranking algorithm employs Gaussian Process regression to predict the normalized click count for each image, and combines it with the original ranking score. Our approach is shown to significantly boost the performance of the Bing image search engine on a wide range of tail queries." ; , ; "March/April" ; "277" ; ; "2011" ; a ; "Learning to Re-Rank: Query-Dependent Image Re-Ranking Using Click Data" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , , , , , ; "Like like alike - Joint Friendship and Interest Propagation in Social Networks" ; ; "Targeting interest to match a user with services (e.g. news, products, games, advertisements) and predicting friendship to build connections among users are two fundamental tasks for social network systems. In this paper, we show that the information contained in interest networks (i.e. user-service interactions) and friendship networks (i.e. user-user connections) is highly correlated and mutually helpful. We propose a framework that exploits homophily to establish an integrated network linking a user to interested services and connecting different users with common interests, upon which both friendship and interests could be efficiently propagated. The proposed friendship-interest propagation (FIP) framework devises a factor-based random walk model to explain friendship connections, and simultaneously it uses a coupled latent factor model to uncover interest interactions. We discuss the flexibility of the framework in the choices of loss objectives and regularization penalties and benchmark different variants on the Yahoo! Pulse social networking system. Experiments demonstrate that by coupling friendship with interest, FIP achieves much higher performance on both interest targeting and friendship prediction than systems using only one source of information." ; , , , , , ; "March/April" ; "537" ; ; "2011" ; a ; "Like like alike - Joint Friendship and Interest Propagation in Social Networks" ; , , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; ; , , ; "Limiting the Spread of Misinformation in Social Networks" ; ; "In this work, we study the notion of competing campaigns in a social network and address the problem of in uence limitation where a bad campaign starts propagating from a certain node in the network and use the notion of limiting campaigns to counteract the effect of misinformation. The problem can be summarized as identifying a subset of individuals that need to be convinced to adopt the competing (or good ) campaign so as to minimize the number of people that adopt the bad campaign at the end of both propagation processes. We show that this optimization problem is NP-hard and provide approximation guarantees for a greedy solution for various de nitions of this problem by proving that they are submodular. We experimentally compare the performance of the greedy method to various heuristics. The experiments reveal that in most cases inexpensive heuristics such as degree centrality compare well with the greedy approach. We also study the in uence limitation problem in the presence of missing data where the current states of nodes in the network are only known with a certain probability and show that prediction in this setting is a supermodular problem. We propose a prediction algorithm that is based on generating random spanning trees and evaluate the performance of this approach. The experiments reveal that using the prediction algorithm, we are able to tolerate about 90% missing data before the performance of the algorithm starts degrading and even with large amounts of missing data the performance degrades only to 75% of the performance that would be achieved with complete data." ; , , ; "March/April" ; "665" ; ; "2011" ; a ; "Limiting the Spread of Misinformation in Social Networks" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "Mark My Words! Linguistic Style Accommodation in Social Media" ; ; "The psycholinguistic theory of communication accommodation accounts for the general observation that participants in conversations tend to converge to one another s communicative behavior: they coordinate in a variety of dimensions including choice of words, syntax, utterance length, pitch and gestures. In its almost forty years of existence, this theory has been empirically supported exclusively through small-scale or controlled laboratory studies. Here we address this phenomenon in the context of Twitter conversations. Undoubtedly, this setting is unlike any other in which accommodation was observed and, thus, challenging to the theory. Its novelty comes not only from its size, but also from the non real-time nature of conversations, from the 140 character length restriction, from the wide variety of social relation types, and from a design that was initially not geared towards conversation at all. Given such constraints, it is not clear a priori whether accommodation is robust enough to occur given the constraints of this new environment. To investigate this, we develop a probabilistic framework that can model accommodation and measure its effects. We apply it to a large Twitter conversational dataset specifically developed for this task. This is the first time the hypothesis of linguistic style accommodation has been examined (and verified) in a large scale, real world setting. Furthermore, when investigating concepts such as stylistic influence and symmetry of accommodation, we discover a complexity of the phenomenon which was never observed before. We also explore the potential relation between stylistic influence and network features commonly associated with social status." ; , , ; "March/April" ; "745" ; ; "2011" ; a ; "Mark My Words! Linguistic Style Accommodation in Social Media" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "Measuring a Commercial Content Delivery Network" ; ; "Content delivery networks (CDNs) have become a crucial part of the modern Web infrastructure. This paper studies the performance of the leading content delivery provider - Akamai. It measures the performance of the current Akamai platform and considers a key architectural question faced by both CDN designers and their prospective customers: whether the co-location approach to CDN platforms adopted by Akamai, which tries to deploy servers in numerous Internet locations, brings inherent performance benefits over a more consolidated data center approach pursued by other influential CDNs such as Limelight. We believe the methodology we developed for this study will be useful for other researchers in the CDN arena." ; , , ; "March/April" ; "467" ; ; "2011" ; a ; "Measuring a Commercial Content Delivery Network" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "Milgram-Routing in Social Networks" ; ; "We demonstrate how a recent model of social networks ( Affiliation Networks , [21]) offers powerful cues in local routing within social networks, a theme made famous by sociologist Milgram s six degrees of separation experiments. This model posits the existence of an interest space that underlies a social network; we prove that in networks produced by this model, not only do short paths exist among all pairs of nodes but natural local routing algorithms can discover them effectively. Specifically, we show that local routing can discover paths of length O(log2 n) to targets chosen uniformly at random, and paths of length O(1) to targets chosen with probability proportional to their degrees. Experiments on the co-authorship graph derived from DBLP data confirm our theoretical results, and shed light into the power of one step of lookahead in routing algorithms for social networks." ; , , ; "March/April" ; "725" ; ; "2011" ; a ; "Milgram-Routing in Social Networks" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , , ; "Model Characterization Curves for Federated Search Using Click-Logs: Predicting User Engagement Metrics for the Span of Feasible Operating Points" ; ; "Modern day federated search engines aggregate heterogeneous types of results from multiple vertical search engines and compose a single search engine result page (SERP). The search engine aggregates the results and produces one ranked list, constraining the vertical results to specific slots on the SERP. The usual way to compare two ranking algorithms is to first fix their operating points (internal thresholds), and then run an online experiment that lasts multiple weeks. Online user engagement metrics are then compared to decide which algorithm is better. However, this method does not characterize and compare the behavior over the entire span of operating points. Furthermore, this time-consuming approach is not practical if we have to conduct the experiment over numerous operating points. In this paper we propose a method of characterizing the performance of models that allows us to predict answers to ``what if'' questions about online user engagement using click-logs over the entire span of feasible operating points. We audition verticals at various slots on the SERP and generate click-logs. This log is then used to create operating curves between variables of interest (for example between result quality and click-through). The operating point for the system then can be chosen to achieve a specific trade-off between the variables. We apply this methodology to predict i) the online performance of two different models, ii) the impact of changing internal quality thresholds on clickthrough, iii) the behavior of introducing a new feature, iv) which machine learning loss function will give better online engagement, v) the impact of sampling distribution of head and tail queries in the training process. The results are reported on a well-known federated search engine. We validate the predictions with online experiments." ; , , , ; "March/April" ; "67" ; ; "2011" ; a ; "Model Characterization Curves for Federated Search Using Click-Logs: Predicting User Engagement Metrics for the Span of Feasible Operating Points" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , ; "Modeling the Temporal Dynamics of Social Rating Networks Using Bidirectional Effects of Social Relations and Rating Patterns" ; ; "A social rating network (SRN) is a social network in which edges represent social relationships and users (nodes) express ratings on some of the given items. Such networks play an increasingly important role in reviewing websites such as Epinions.com or online sharing websites like Flickr.com. In this paper, we first observe and analyze the temporal behavior of users in a social rating network, who express ratings and create social relations. Then, we model the temporal dynamics of an SRN based on our observations, using the bidirectional effects of ratings and social relations. While existing models for other types of social networks have captured some of the effects, our model is the first one to represent all four effects, i.e. social relations-on-ratings (social influence), social relations-on-social relations (transitivity), ratings-on-social relations (selection), and ratings-on-ratings (correlational influence). Existing works consider these effects as static and constant throughout the evolution of an SRN, however our observations reveal that these effects are actually dynamic. We propose a probabilistic generative model for SRNs, which models the strength and dynamics of each effect throughout the network evolution. This model can serve for the prediction of future links, ratings or community structures. Due to the sensitive nature of SRNs, another motivation for our work is the generation of synthetic SRN data sets for research purposes. Our experimental studies on two real life datasets (Epinions and Flickr) demonstrate that the proposed model produces social rating networks that agree with real world data on a comprehensive set of evaluation criteria." ; , , ; "March/April" ; "527" ; ; "2011" ; a ; "Modeling the Temporal Dynamics of Social Rating Networks Using Bidirectional Effects of Social Relations and Rating Patterns" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , ; "Network Bucket Testing" ; ; "Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new feature on the site by exposing it to a very small fraction of the total user population and measuring its effect on this exposed group. For traditional uses of this technique, uniform independent sampling of the population is often enough to produce an exposed group that can serve as a statistical proxy for the full population. In on-line social network applications, however, one often wishes to perform a more complex test: evaluating a new social feature that will only produce an effect if a user and some number of his or her friends are exposed to it. In this case, independent uniform draws from the population will be unlikely to produce groups that contains users together with their friends, and so the construction of the sample must take the network structure into account. This leads quickly to challenging combinatorial problems, since there is an inherent tension between producing enough correlation to select users and their friends, but also enough uniformity and independence that the selected group is a reasonable sample of the full population. Here we develop an algorithmic framework for bucket testing in a network that addresses these challenges. First we describe a novel walk-based sampling method for producing samples of nodes that are internally well-connected but also approximately uniform over the population. Then we show how a collection of multiple independent subgraphs constructed this way can yield reasonable samples for testing. We demonstrate the effectiveness of our algorithms through computational experiments on large portions of the Facebook network." ; , ; "March/April" ; "615" ; ; "2011" ; a ; "Network Bucket Testing" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , ; "On the Informativeness of Cascade and Intent-Aware Effectiveness Measures" ; ; "The Maximum Entropy Method provides one technique for validating search engine effectiveness measures. Under this method, the value of an effectiveness measure is used as a constraint to estimate the most likely distribution of relevant documents under a maximum entropy assumption. This inferred distribution may then be compared to the actual distribution to quantify the \"informativeness\" of the measure. The inferred distribution may also be used to estimate values for other effectiveness measures. Previous work focused on traditional effectiveness measures, such as average precision. In this paper, we extend the Maximum Entropy Method to the newer cascade and intent-aware effectiveness measures by considering the dependency of the documents ranked in a results list. These measures are intended to reflect the novelty and diversity of search results in addition to the traditional relevance. Our results indicate that intent-aware measures based on the cascade model are informative in terms of both inferring actual distribution and predicting the values of other retrieval measures." ; , ; "March/April" ; "407" ; ; "2011" ; a ; "On the Informativeness of Cascade and Intent-Aware Effectiveness Measures" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , ; "Online Spelling Correction for Query Completion" ; ; "In this paper, we study the problem of online spelling correction for query completions. Misspelling is a common phenomenon among search engines queries. In order to help users effectively express their information needs, mechanisms for automatically correcting misspelled queries are required. Online spelling correction aims to provide spell corrected completion suggestions as a query is incrementally entered. As latency is crucial to the utility of the suggestions, such an algorithm needs to be not only accurate, but also efficient. To tackle this problem, we propose and study a generative model for input queries, based on a noisy channel transformation of the intended queries. Utilizing spelling correction pairs, we train a Markov n-gram transformation model that captures user spelling behavior in an unsupervised fashion. To find the top spell-corrected completion suggestions in real-time, we adapt the A* search algorithm with various pruning heuristics to dynamically expand the search space efficiently. Evaluation of the proposed methods demonstrates a substantial increase in the effectiveness of online spelling correction over existing techniques." ; , ; "March/April" ; "117" ; ; "2011" ; a ; "Online Spelling Correction for Query Completion" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , , , ; "Parallel Boosted Regression Trees for Web Search Ranking" ; ; "Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned web-search ranking - a domain notorious for very large data sets. In this paper, we propose a novel method for parallelizing the training of GBRT. Our technique parallelizes the construction of the individual regression trees and operates using the master-worker paradigm as follows. The data are partitioned among the workers. At each iteration, the worker summarizes its data-partition using histograms. The master processor uses these to build one layer of a regression tree, and then sends this layer to the workers, allowing the workers to build histograms for the next layer. Our algorithm carefully orchestrates overlap between communication and computation to achieve good performance. Since this approach is based on data partitioning, and requires a small amount of communication, it generalizes to distributed and shared memory machines, as well as clouds. We present experimental results on both shared memory machines and clusters for two large scale web search ranking data sets. We demonstrate that the loss in accuracy induced due to the histogram approximation in the regression tree creation can be compensated for through slightly deeper trees. As a result, we see no significant loss in accuracy on the Yahoo data sets and a very small reduction in accuracy for the Microsoft LETOR data. In addition, on shared memory machines, we obtain almost perfect linear speed-up with up to about 48 cores on the large data sets. On distributed memory machines, we get a speedup of 25 with 32 processors. Due to data partitioning our approach can scale to even larger data sets, on which one can reasonably expect even higher speedups." ; , , , ; "March/April" ; "387" ; ; "2011" ; a ; "Parallel Boosted Regression Trees for Web Search Ranking" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , ; "Pay as You Browse: Microcomputations as Micropayments in Web-Based Services" ; ; "Currently, several online businesses deem that advertising revenues alone are not sufficient to generate profits and are therefore set to charge for online content. In this paper, we explore a complement to the current advertisement model; more specifically, we propose a micropayment model for non-specialized commodity web-services based on microcomputations. In our model, a user that wishes to access online content offered by a website does not need to register or pay to access the website; instead, he will accept to run microcomputations on behalf of the website in exchange for access to the content. These microcomputations can, for example, support ongoing computing projects that have clear social benefits (e.g., projects relating to HIV, dengue, cancer, etc.) or can contribute towards commercial computing projects. We argue that this micropayment model is economically and technically viable and that it can be integrated in existing distributed computing frameworks (e.g., the BOINC platform). We implement a preliminary prototype of a system based on our model through which we evaluate its performance and usability. Finally, we analyze the security and privacy of our proposal and we show that it ensures payment for the content while preserving the privacy of users." ; , , ; "March/April" ; "307" ; ; "2011" ; a ; "Pay as You Browse: Microcomputations as Micropayments in Web-Based Services" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , , , ; "Pragmatic Evaluation of Folksonomies" ; ; "Recently, a number of algorithms have been proposed to obtain hierarchical structures so-called folksonomies from social tagging data. Work on these algorithms is in part driven by a belief that folksonomies are useful for tasks such as: (a) Navigating social tagging systems and (b) Acquiring semantic relationships between tags. While the promises and pitfalls of the latter have been studied to some extent, we know very little about the extent to which folksonomies are pragmatically useful for navigating social tagging systems. This paper sets out to address this gap by presenting and applying a pragmatic framework for evaluating folksonomies. We model exploratory navigation of a tagging system as decentralized search on a network of tags. Evaluation is based on the fact that the performance of a decentralized search algorithm depends on the quality of the background knowledge used. The key idea of our approach is to use hierarchical structures learned by folksonomy algorithm as background knowledge for decentralized search. Utilizing decentralized search on tag networks in combination with different folksonomies as hierarchical background knowledge allows us to evaluate navigational tasks in social tagging systems. Our experiments with four state-of-the-art folksonomy algorithms on five different social tagging datasets reveal that existing folksonomy algorithms exhibit significant, previously undiscovered, differences with regard to their utility for navigation. Our results are relevant for engineers aiming to improve navigability of social tagging systems and for scientists aiming to evaluate different folksonomy algorithms from a pragmatic perspective." ; , , , , ; "March/April" ; "417" ; ; "2011" ; a ; "Pragmatic Evaluation of Folksonomies" ; , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; ; , , , ; "Prophiler: A Fast Filter for the Large-Scale Detection of Malicious Web Pages" ; ; "Malicious web pages that host drive-by-download exploits have become a popular means for compromising hosts on the Internet and, subsequently, for creating large-scale botnets. In a drive-by-download exploit, an attacker embeds a malicious script (typically written in JavaScript) into a web page. When a victim visits this page, the script is executed and attempts to compromise the browser or one of its plugins. To detect drive-by-download exploits, researchers have developed a number of systems that analyze web pages for the presence of malicious code. Most of these systems use dynamic analysis. That is, they run the scripts associated with a web page either directly in a real browser (running in a virtualized environment) or in an emulated browser, and they monitor the scripts' executions for malicious activity. While the tools are quite precise, the analysis process is costly, often requiring in the order of tens of seconds for a single page. Therefore, performing this analysis on a large set of web pages containing hundreds of millions of samples can be prohibitive. One approach to reduce the resources required for performing large-scale analysis of malicious web pages is to develop a fast and reliable filter that can quickly discard pages that are benign, forwarding to the costly analysis tools only the pages that are likely to contain malicious code. In this paper, we describe the design and implementation of such a filter. Our filter, called Prophiler, uses static analysis techniques to quickly examine a web page for malicious content. This analysis takes into account features derived from the HTML contents of a page, from the associated JavaScript code, and from the corresponding URL. We automatically derive detection models that use these features using machine-learning techniques applied to labeled datasets. To demonstrate the effectiveness and efficiency of Prophiler, we crawled and collected millions of pages, which we analyzed for malicious behavior. Our results show that our filter is able to reduce the load on a more costly dynamic analysis tools by more than 85%, with a negligible amount of missed malicious pages." ; , , , ; "March/April" ; "197" ; ; "2011" ; a ; "Prophiler: A Fast Filter for the Large-Scale Detection of Malicious Web Pages" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , ; "Query Segmentation Revisited" ; ; "We address the problem of query segmentation: given a keyword query, the task is to group the keywords into phrases, if possible. Previous approaches to the problem achieve reasonable segmentation performance but are tested only against a small corpus of manually segmented queries. In addition, many of the previous approaches are fairly intricate as they use expensive features and are difficult to be reimplemented. The main contribution of this paper is a new method for query segmentation that is easy to implement, fast, and that comes with a segmentation accuracy comparable to current state-of-the-art techniques. Our method uses only raw web n-gram frequencies and Wikipedia titles that are stored in a hash table. At the same time, we introduce a new evaluation corpus for query segmentation. With about 50000 human-annotated queries, it is two orders of magnitude larger than the corpus being used up to now." ; , , , ; "March/April" ; "97" ; ; "2011" ; a ; "Query Segmentation Revisited" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , , , ; "Rewriting Queries on SPARQL Views" ; ; "The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, or when integrating RDF data from disparate sources. We approach this problem by rewriting SPARQL queries over the views to equivalent queries over the underlying RDF data, thus avoiding the costs entailed by view materialization and maintenance. We show that SPARQL query rewriting combines the most challenging aspects of rewriting for the relational and XML cases: like the relational case, SPARQL query rewriting requires synthesizing multiple views; like the XML case, the size of the rewritten query is exponential to the size of the query and the views. In this paper, we present the first native query rewriting algorithm for SPARQL. For an input SPARQL query over a set of virtual SPARQL views, the rewritten query resembles a union of conjunctive queries and can be of exponential size. We propose optimizations over the basic rewriting algorithm to (i) minimize each conjunctive query in the union; (ii) eliminate conjunctive queries with empty results from evaluation; and (iii) efficiently prune out big portions of the search space of empty rewritings. The experiments, performed on two RDF stores, show that our algorithms are scalable and independent of the underlying RDF stores. Furthermore, our optimizations have order of magnitude improvements over the basic rewriting algorithm in both the rewriting size and evaluation time." ; , , , , ; "March/April" ; "655" ; ; "2011" ; a ; "Rewriting Queries on SPARQL Views" ; , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; ; , , , , , , , , ; "SafeVchat: Detecting Obscene Content and Misbehaving Users in Online Video Chat Services" ; ; "Online video chat services such as Chatroulette, Omegle, and vChatter that randomly match pairs of users in video chat sessions are fast becoming very popular, with over a million users per month in the case of Chatroulette. A key problem encountered in such systems is the presence of flashers and obscene content. This problem is especially acute given the presence of underage minors in such systems. This paper presents SafeVchat, a novel solution to the problem of flasher detection that employs an array of image detection algorithms. A key contribution of the paper concerns how the results of the individual detectors are fused together into an overall decision classifying the user as misbehaving or not, based on Dempster-Shafer Theory. The paper introduces a novel, motion-based skin detection method that achieves significantly higher recall and better precision. The proposed methods have been evaluated over real-world data and image traces obtained from Chatroulette.com." ; , , , , , , , , ; "March/April" ; "685" ; ; "2011" ; a ; "SafeVchat: Detecting Obscene Content and Misbehaving Users in Online Video Chat Services" ; , , , , , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; rdf:_7 ; rdf:_8 ; rdf:_9 ; a rdf:Seq . ; ; , , , ; "SCAD: Collective Discovery of Attribute Values" ; ; "Search engines today offer a rich user experience, no longer restricted to ``ten blue links''. For example, the query ``Canon EOS Digital Camera'' returns a photo of the digital camera, and a list of suitable merchants and prices. Similar results are offered in other domains like food, entertainment, travel, etc. All these experiences are fueled by the availability of structured data about the entities of interest. To obtain this structured data, it is necessary to solve the following problem: given a category of entities with its schema, and a set of Web pages that mention and describe entities belonging to the category, build a structured representation for the entity under the given schema. Specifically, collect structured numerical or discrete attributes of the entities. Most previous approaches regarded this as an information extraction problem on individual documents, and made no special use of numerical attributes. In contrast, we present an end-to-end framework which leverages signals not only from the Web page context, but also from a collective analysis of all the pages corresponding to an entity, and from constraints related to the actual values within the domain. Our current implementation uses a general and flexible Integer Linear Program (ILP) to integrate all these signals into holistic decisions over all attributes. There is one ILP per entity and it is small enough to be solved in under 38 milliseconds in our experiments. We apply the new framework to a setting of significant practical importance: catalog expansion for Commerce search engines, using data from Bing Shopping. Finally, we present experiments that validate the effectiveness of the framework and its superiority to local extraction." ; , , , ; "March/April" ; "447" ; ; "2011" ; a ; "SCAD: Collective Discovery of Attribute Values" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , ; "Search Result Diversity for Informational Queries" ; ; "Ambiguous queries constitute a significant fraction of search instances and pose real challenges to web search engines. With current approaches the top results for these queries tend to be homogeneous, making it difficult for users interested in less popular aspects to find relevant documents. While existing research in search diversification offers several solutions for introducing variety into the results, the majority of such work is predicated, implicitly or otherwise, on the assumption that a single relevant document will fulfill a user's information need, making them inadequate for many informational queries. In this paper we present a search-diversification algorithm particularly suitable for informational queries by explicitly modeling that the user may need more than one page to satisfy their need. This modeling enables our algorithm to make a well-informed tradeoff between a user's desire for multiple relevant documents, probabilistic information about an average user's interest in the subtopics of a multifaceted query, and uncertainty in classifying documents into those subtopics. We evaluate the effectiveness of our algorithm against commercial search engine results and other modern ranking strategies, demonstrating notable improvement in multiple document scenarios." ; , , ; "March/April" ; "237" ; ; "2011" ; a ; "Search Result Diversity for Informational Queries" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , ; "SEISA: Set Expansion by Iterative Similarity Aggregation" ; ; "In this paper, we study the problem of expanding a set of given seed entities into a more complete set by discovering other entities that also belong to the same concept set. A typical example is to use Canon and Nikon as seed entities, and derive other entities (e.g., Olympus ) in the same concept set of camera brands. In order to discover such relevant entities, we exploit several web data sources, including lists extracted from web pages and user queries from a web search engine. While these web data are highly diverse with rich information that usually cover a wide range of the domains of interest, they tend to be very noisy. We observe that previously proposed random walk based approaches do not perform very well on these noisy data sources. Accordingly, we propose a new general framework based on iterative similarity aggregation, and present detailed experimental results to show that, when using general-purpose web data for set expansion, our approach outperforms previous techniques in terms of both precision and recall." ; , ; "March/April" ; "427" ; ; "2011" ; a ; "SEISA: Set Expansion by Iterative Similarity Aggregation" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , ; "Semi-Supervised Truth Discovery" ; ; "Accessing online information from various data sources has become a necessary part of our everyday life. Unfortunately such information is not always trustworthy, as different sources are of very different qualities and often provide inaccurate and conflicting information. Existing approaches attack this problem using unsupervised learning methods, and try to infer the confidence of the data value and trustworthiness of each source from each other by assuming values provided by more sources are more accurate. However, because false values can be widespread through copying among different sources and out-of-date data often overwhelm up-to-date data, such bootstrapping methods are often ineffective. In this paper we propose a semi-supervised approach that finds true values with the help of ground truth data. Such ground truth data, even in very small amount, can greatly help us identify trustworthy data sources. Unlike existing studies that only provide iterative algorithms, we derive the optimal solution to our problem and provide an iterative algorithm that converges to it. Experiments show our method achieves higher accuracy than existing approaches, and it can be applied on very huge data sets when implemented with MapReduce." ; , ; "March/April" ; "217" ; ; "2011" ; a ; "Semi-Supervised Truth Discovery" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , ; "SourceRank: Relevance and Trust Assessment for Deep Web Sources Based on Inter-Source Agreement" ; ; "One immediate challenge in searching the deep web databases is \"source selection\"---i.e. selecting the most relevant web databases for answering a given query. The existing database selection methods (both text and relational) assess the source quality based on the query-similarity-based relevance assessment. When applied to the deep web these methods have two deficiencies. First is that the methods are agnostic to the correctness (trustworthiness) of the sources. Secondly, the query based relevance does not consider the importance of the results. These two considerations are essential for the open collections like the deep web. Since a number of sources provide answers to any query, we conjuncture that the agreements between these answers are likely to be helpful in assessing the importance and the trustworthiness of the sources. We compute the agreement between the sources as the agreement of the answers returned. While computing the agreement, we also measure and compensate for possible \"collusion\" between the sources. This adjusted agreement is modeled as a graph with sources at the vertices. On this agreement graph, a quality score of a source that we call \"SourceRank\", is calculated as the stationary visit probability of a random walk. We evaluate SourceRank in multiple domains, including sources in Google Base, with sizes up to 675 sources. We demonstrate that the SourceRank tracks source corruption. Further, our relevance evaluations show that SourceRank improves precision by 22-60% over the Google Base and the other baseline methods. SourceRank has been implemented in a system called \"Factal\"." ; , ; "March/April" ; "227" ; ; "2011" ; a ; "SourceRank: Relevance and Trust Assessment for Deep Web Sources Based on Inter-Source Agreement" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , , , , , ; "Sparse Hidden-Dynamics Conditional Random Fields for User Intent Understanding" ; ; "Understanding user intent from her sequential search behaviors, i.e. predicting the intent of each user query in a search session, is crucial for modern Web search engines. However, due to the huge number of user behavior variables and coarse level intent labels defined by human editors, it is very difficult to directly model user behavioral dynamics or user intent dynamics in user search sessions. In this paper, we propose a novel Sparse Hidden-Dynamic Conditional Random Fields (SHDCRF) model for user intent learning from their search sessions. Through incorporating the proposed hidden state variables, SHDCRF aims to learn a substructure, i.e. a set of related hidden variables, for each intent label and they are used to model the intermediate dynamics between user intent labels and user behavioral variables. In addition, SHDCRF learns a sparse relation between the hidden variables and intent labels to make the hidden state variables explainable. Extensive experiment results, on real user search sessions from a popular commercial search engine show that the proposed SHDCRF model significantly outperforms in terms of intent prediction results that those classical solutions such as Support Vector Machine (SVM), Conditional Random Field (CRF) and Latnet-Dynamic Conditional Random Field (LDCRF)." ; , , , , , ; "March/April" ; "7" ; ; "2011" ; a ; "Sparse Hidden-Dynamics Conditional Random Fields for User Intent Understanding" ; , , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; ; , , , , , , , , , , , ; "Statically Locating Web Application Bugs Caused by Asynchronous Calls" ; ; "Ajax becomes more and more important for web applications that care about client side user experience. It allows sending requests asynchronously, without blocking clients from continuing execution. Callback functions are only executed upon receiving the responses. While such mechanism makes browsing a smooth experience, it may cause severe problems in the presence of unexpected network latency, due to the non-determinism of asynchronism. In this paper, we demonstrate the possible problems caused by the asynchronism and propose a static program analysis to automatically detect such bugs in web applications. As client side Ajax code is often wrapped in server-side scripts, we also develop a technique that extracts client-side JavaScript code from server-side scripts. We evaluate our technique on a number of real-world web applications. Our results show that it can effectively identify real bugs. We also discuss possible ways to avoid such bugs." ; , , , , , , , , , , , ; "March/April" ; "805" ; ; "2011" ; a ; "Statically Locating Web Application Bugs Caused by Asynchronous Calls" ; , , , , , , , , , , , ; , . rdf:_1 ; rdf:_10 ; rdf:_11 ; rdf:_12 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; rdf:_7 ; rdf:_8 ; rdf:_9 ; a rdf:Seq . ; ; , ; "Supporting Synchronous Social Q&A Throughout the Question Lifecycle" ; ; "Synchronous social Q&A systems exist on the Web and in the enterprise to connect people with questions to people with answers in real-time. In such systems, askers desire for quick answers is in tension with costs associated with interrupting numerous candidate answerers per question. Supporting users of synchronous social Q&A systems at various points in the question lifecycle (from conception to answer) helps askers make informed decisions about the likelihood of question success and helps answerers face fewer interruptions. For example, predicting that a question will not be well answered may lead the asker to rephrase or retract the question. Similarly, predicting that an answer is not forthcoming during the dialog can prompt system behaviors such as finding other answerers to join the conversation. As another example, predictions of asker satisfaction can be assigned to completed conversations and used for later retrieval. In this paper, we use data from an instant-messaging-based syn-chronous social Q&A service deployed to an online community of over two thousand users to study the prediction of: (i) whether a question will be answered, (ii) the number of candidate answerers that the question will be sent to, and (iii) whether the asker will be satisfied by the answer received. Predictions are made at many points of the question lifecycle (e.g., when the question is entered, when the answerer is located, halfway through the asker-answerer dialog, etc.). The findings from our study show that we can learn capable models for these tasks using a broad range of features derived from user profiles, system interactions, question setting, and the dialog between asker and answerer. Our research can lead to more sophisticated and more useful real-time Q&A support." ; , ; "March/April" ; "755" ; ; "2011" ; a ; "Supporting Synchronous Social Q&A Throughout the Question Lifecycle" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , , , ; "The Design and Usage of Tentative Events for Time-Based Social Coordination in the Enterprise" ; ; "Existing enterprise calendaring systems have suffered from problems like rigidity, lack of transparency, and poor integration with social networks. We present the system design and rationale for a novel social coordination mechanism, called \"Suggestions,\" that addresses these issues. Our system integrates ideas drawn from designs of lightweight polling systems and one's social network into an open calendar tool, providing a space for users to coordinate, socialize around, or negotiate the \"what\" and the \"when\" of their events. Suggestions was released inside a large enterprise setting, where initial interviews revealed users' thoughts on transparent scheduling, reaching wider audiences and task appropriateness, and suggested ways to improve our design." ; , , , ; "March/April" ; "765" ; ; "2011" ; a ; "The Design and Usage of Tentative Events for Time-Based Social Coordination in the Enterprise" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , , ; "The Web of Topics: Discovering the Topology of Topic Evolution in a Corpus" ; ; "In this paper we study how to discover the evolution of topics over time in a time-stamped document collection. Our approach is uniquely designed to capture the rich topology of topic evolution inherent in the corpus. Instead of characterizing the evolving topics at fixed time points, we conceptually define a topic as a quantized unit of evolutionary change in content and discover topics with the time of their appearance in the corpus. Discovered topics are then connected to form a topic evolution graph using a measure derived from the underlying document network. Our approach allows inhomogeneous distribution of topics over time and does not impose any topological restriction in topic evolution graphs. We evaluate our algorithm on the ACM corpus. The topic evolution graphs obtained from the ACM corpus provide an effective and concrete summary of the corpus with remarkably rich topology that are congruent to our background knowledge. In a finer resolution, the graphs reveal concrete information about the corpus that were previously unknown to us, suggesting the utility of our approach as a navigational tool for the corpus." ; , , ; "March/April" ; "257" ; ; "2011" ; a ; "The Web of Topics: Discovering the Topology of Topic Evolution in a Corpus" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "Towards a Theory Model for Product Search" ; ; "With the growing pervasiveness of the Internet, online search for products and services is constantly increasing. Most product search engines are based on adaptations of theoretical models devised for information retrieval. However, the decision mechanism that underlies the process of buying a product is different than the process of locating relevant documents or objects. We propose a theory model for product search based on expected utility theory from economics. Specifically, we propose a ranking technique in which we rank highest the products that generate the highest surplus, after the purchase. In a sense, the top ranked products are the ``best value for money'' for a specific user. Our approach builds on research on ``demand estimation'' from economics and presents a solid theoretical foundation on which further research can build on. We build algorithms that take into account consumer demographics, heterogeneity of consumer preferences, and also account for the varying price of the products. We show how to achieve this without knowing the demographics or purchasing histories of individual consumers but by using aggregate demand data. We evaluate our work, by applying the techniques on hotel search. Our extensive user studies, using more than 15,000 user-provided ranking comparisons, demonstrate an overwhelming preference for the rankings generated by our techniques, compared to a large number of existing strong state-of-the-art baselines." ; , , ; "March/April" ; "327" ; ; "2011" ; a ; "Towards a Theory Model for Product Search" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "Towards Semantic Knowledge Propagation from Text Corpus to Web Images" ; ; "In this paper, we study the problem of transfer learning from text to images in the context of network data in which link based bridges are available to transfer the knowledge between the different domains. The problem of classification of image data is often much more challenging than text data because of the following two reasons: (a) Labeled text data is very widely available for classification purposes. On the other hand, this is often not the case for image data, in which a lot of images are available from many sources, but many of them are often not labeled. (b) The image features are not directly related to semantic concepts inherent in class labels. On the other hand, since text data tends to have natural semantic interpretability (because of their human origins), they are often more directly related to class labels. Therefore, the relationships between the images and text features also provide additional hints for the classification process in terms of the image feature transformations which provide the most effective results. The semantic challenges of image features are glaringly evident, when we attempt to recognize complex abstract concepts, and the visual features often fail to discriminate such concepts. However, the copious availability of bridging relationships between text and images in the context of web and social network data can be used in order to design for effective classifiers for image data. One of our goals in this paper is to develop a mathematical model for the functional relationships between text and image features, so as indirectly transfer semantic knowledge through feature transformations. This feature transformation is accomplished by mapping instances from different domains into a common space of unspecific topics. This is used as a bridge to semantically connect the two heterogeneous spaces. This is also helpful for the cases where little image data is available for the classification process. We evaluate our knowledge transfer techniques on an image classification task with labeled text corpora and show the effectiveness with respect to competing algorithms." ; , , ; "March/April" ; "297" ; ; "2011" ; a ; "Towards Semantic Knowledge Propagation from Text Corpus to Web Images" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , , ; "Track Globally, Deliver Locally: Improving Content Delivery Networks by Tracking Geographic Social Cascades" ; ; "Providers such as YouTube offer easy access to multimedia content to millions, generating high bandwidth and storage demand on the Content Delivery Networks they rely upon. More and more, the diffusion of this content happens on online social networks such as Facebook and Twitter, where social cascades can be observed when users increasingly repost links they have received from others. In this paper we describe how geographic information extracted from social cascades can be exploited to improve caching of multimedia files in a Content Delivery Network. We take advantage of the fact that social cascades can propagate in a geographically limited area to discern whether an item is spreading locally or globally. This informs cache replacement policies, which utilize this information to ensure that content relevant to a cascade is kept close to the users who may be interested in it. We validate our approach by using a novel dataset which combines social interaction data with geographic information: we track social cascades of YouTube links over Twitter and build a proof-of-concept geographic model of a realistic distributed Content Delivery Network. Our performance evaluation shows that we are able to improve cache hits with respect to cache policies without geographic and social information." ; , , , ; "March/April" ; "457" ; ; "2011" ; a ; "Track Globally, Deliver Locally: Improving Content Delivery Networks by Tracking Geographic Social Cascades" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; , ; "Turkalytics: Analytics for Human Computation" ; ; "We present \"Turkalytics,\" a novel analytics tool for human computation systems. Turkalytics processes and reports logging events from workers in real-time and has been shown to scale to over one hundred thousand logging events per day. We present a state model for worker interaction that covers the Mechanical Turk (the SCRAP model) and a data model that demonstrates the diversity of data collected by Turkalytics. We show that Turkalytics is effective at data collection, in spite of it being unobtrusive. Lastly, we describe worker locations, browser environments, activity information, and other examples of data collected by our tool." ; , ; "March/April" ; "477" ; ; "2011" ; a ; "Turkalytics: Analytics for Human Computation" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; , , , , , ; "Unified Analysis of Streaming News" ; ; "News clustering, categorization and analysis are key components of any news portal. They require algorithms capable of dealing with dynamic data to cluster, interpret and to temporally aggregate news articles. These three tasks are often solved separately. In this paper we present a unified framework to group incoming news articles into temporary but tightly-focused storylines, to identify prevalent topics and key entities within these stories, and to reveal the temporal structure of stories as they evolve. We achieve this by building a hybrid clustering and topic model. To deal with the available wealth of data we build an efficient parallel inference algorithm by sequential Monte Carlo estimation. Time and memory costs are nearly constant in the length of the history, and the approach scales to hundreds of thousands of documents. We demonstrate the efficiency and accuracy on the publicly available TDT dataset and data of a major internet news site." ; , , , , , ; "March/April" ; "267" ; ; "2011" ; a ; "Unified Analysis of Streaming News" ; , , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; ; , , , , ; "Video Summarization Via Transferrable Structured Learning" ; ; "It is well-known that textual information such as video transcripts and video reviews can significantly enhance the performance of video summarization algorithms. Unfortunately, many videos on the Web such as those from the popular video sharing site YouTube do not have useful textual information. The goal of this paper is to propose a transfer learning framework for video summarization: in the training process both the video features and textual features are exploited to train a summarization algorithm while for summarizing a new video only its video features are utilized. The basic idea is to explore the transferability between videos and their corresponding textual information. Based on the assumption that video features and textual features are highly correlated with each other, we can transfer textual information into knowledge on summarization using video information only. In particular, we formulate the video summarization problem as that of learning a mapping from a set of shots of a video to a subset of the shots using the general framework of SVM-based structured learning. Textual information is transferred by encoding them into a set of constraints used in the structured learning process which tend to provide a more detailed and accurate characterization of the different subsets of shots. Experimental results show significant performance improvement of our approach and demonstrate the utility of textual information for enhancing video summarization." ; , , , , ; "March/April" ; "287" ; ; "2011" ; a ; "Video Summarization Via Transferrable Structured Learning" ; , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; ; , , , , , , ; "we.b: The Web of Short URLs" ; ; "Short URLs have become ubiquitous. Especially popular within social networking services, short URLs have seen a significant increase in their usage over the past years, mostly due to Twitter's restriction of message length to 140 characters. In this paper, we provide a first characterization on the usage of short URLs. Specifically, our goal is to examine the content short URLs point to, how they are published, their popularity and activity over time, as well as their potential impact on the performance of the web. Our study is based on traces of short URLs as seen from two different perspectives: i) collected through a large-scale crawl of URL shortening services, and ii) collected by crawling Twitter messages. The former provides a general characterization on the usage of short URLs, while the latter provides a more focused view on how certain communities use shortening services. Our analysis highlights that domain and website popularity, as seen from short URLs, significantly differs from the distributions provided by well publicised services such as Alexa. The set of most popular websites pointed to by short URLs appears stable over time, despite the fact that short URLs have a limited high popularity lifetime. Surprisingly short URLs are not ephemeral, as a significant fraction, roughly 50%, appears active for more than three months. Overall, our study emphasizes the fact that short URLs reflect an ``alternative'' web and, hence, provide an additional view on web usage and content consumption complementing traditional measurement sources. Furthermore, our study reveals the need for alternative shortening architectures that will eliminate the non-negligible performance penalty imposed by today's shortening services." ; , , , , , , ; "March/April" ; "715" ; ; "2011" ; a ; "we.b: The Web of Short URLs" ; , , , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; rdf:_7 ; a rdf:Seq . ; ; , , , , , ; "We Know Who You Followed Last Summer: Inferring Social Link Creation Times in Twitter" ; ; "Understanding a network s temporal evolution appears to require multiple observations of the graph over time. These often expensive repeated crawls are only able to answer questions about what happened from observation to observation, and not what happened before or between network snapshots. Contrary to this picture, we propose a method for Twitter s social network that takes a single static snapshot of network edges and user account creation times to accurately infer when these edges were formed. This method can be exact in theory, and we demonstrate empirically for a large subset of Twitter relationships that it is accurate to within a few hours in practice. We study users who have a very large number of edges or who are recommended by Twitter. We examine the graph formed by these nearly 1,800 Twitter celebrities and their 862 million edges in detail, showing that a single static snapshot can give novel insights about Twitter s evolution. We conclude from this analysis that real-world events and changes to Twitter s interface for recommending users strongly influence network growth." ; , , , , , ; "March/April" ; "517" ; ; "2011" ; a ; "We Know Who You Followed Last Summer: Inferring Social Link Creation Times in Twitter" ; , , , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; ; , , ; "Web Scale NLP: A Case Study on URL Word Breaking" ; ; "This paper uses the URL word breaking task as an example to elaborate what we identify as crucial in designing statistical natural language processing (NLP) algorithms for Web scale applications: (1) rudimentary multilingual capabilities to cope with the global nature of the Web, (2) multi-style modeling to handle diverse language styles seen in the Web contents, (3) fast adaptation to keep pace with the dynamic changes of the Web, (4) minimal heuristic assumptions for generalizability and robustness, and (5) possibilities of efficient implementations and minimal manual efforts for processing massive amount of data at a reasonable cost. We first show that the state-of-the-art word breaking techniques can be unified and generalized under the Bayesian minimum risk (BMR) framework that, using a Web scale N-gram, can meet the first three requirements. We discuss how the existing techniques can be viewed as introducing additional assumptions to the basic BMR framework, and describe a generic yet efficient implementa-tion called word synchronous beam search. Testing the framework and its implementation on a series of large scale experiments reveals the following. First, the language style used to build the model plays a critical role in the word breaking task, and the most suitable for the URL word breaking task appears to be that of the document title where the best performance is obtained. Models created from other language styles, such as from document body, anchor text, and even queries, exhibit varying degrees of mismatch. Although all styles benefit from increasing modeling power which, in our experiments, corresponds to the use of a higher order N-gram, the gain is most recognizable for the title model. The heuristics proposed by the prior arts do contribute to the word breaking performance for mismatched or less powerful models, but are less effective and, in many cases, lead to poorer performance than the matched model with minimal assumptions. For the matched model based on document titles, an accuracy rate of 97.18% can already be achieved using simple trigram without any heuristics." ; , , ; "March/April" ; "357" ; ; "2011" ; a ; "Web Scale NLP: A Case Study on URL Word Breaking" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , , ; "Who Says What to Whom on Twitter" ; ; "We study several longstanding questions in media communications research, in the context of the microblogging service Twitter, regarding the production, flow, and consumption of information. To do so, we exploit a recently introduced feature of Twitter known as lists to distinguish between elite users by which we mean celebrities, bloggers, and representatives of media outlets and other formal organizations and ordinary users. Based on this classification, we find a striking concentration of attention on Twitter, in that roughly 50% of URLs consumed are generated by just 20K elite users, where the media produces the most information, but celebrities are the most followed. We also find significant homophily within categories: celebrities listen to celebrities, while bloggers listen to bloggers etc; however, bloggers in general rebroadcast more information than the other categories. Next we re-examine the classical two-step flow theory of communications, finding considerable support for it on Twitter. Third, we find that URLs broadcast by different categories of users or containing different types of content exhibit systematically different lifespans. And finally, we ex- amine the attention paid by the different user categories to different news topics." ; , , , ; "March/April" ; "705" ; ; "2011" ; a ; "Who Says What to Whom on Twitter" ; , , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; ; ; "A Politeness Recognition Tool for Hindi: With Special Emphasis on Online Texts" ; ; "This paper gives an overview of a politeness recognition tool (PoRT) for Hindi that is currently under preparation. It describes the the kind of problems that need to be tackled with before developing the tool, the approach and the methodology that will be adopted for the development and testing of the tool, the current progress and the future plan to achieve this goal." ; ; "March/April" ; "367" ; ; "2011" ; a ; "A Politeness Recognition Tool for Hindi: With Special Emphasis on Online Texts" ; ; , . rdf:_1 ; a rdf:Seq . ; ; ; "Addressing the RDFa Publishing Bottleneck" ; ; "In the more dynamic environments emerging from ad hoc and peer-to-peer networks, our research has explored the extent to which Web-based knowledge sharing as well as community formation require automation to understand human-readable content in a more distributed manner. RDFa is a syntactic format which can leverage this issue by allowing machine-readable data to be easily integrated into XHTML Web pages. Although there is a growing number of tools and techniques for generating and distilling RDFa, comparatively little work has been carried out on publishing existing RDF data sets as an XHTML+RDFa serialization. This paper proposes a generic approach to integrating RDF data into Web pages using the concept of automatically discovered \"topic nodes\". RDFa≤ is a proof-of-concept implementation of this approach and provides an on-line service assisting users in generating and personalizing pages with RDFa. We provide experimental results that support the viability of our approach to generating Web documents such as FOAF-based online profiles as well as RDF vocabularies with little user intervention." ; ; "March/April" ; "331" ; ; "2011" ; a ; "Addressing the RDFa Publishing Bottleneck" ; ; , . rdf:_1 ; a rdf:Seq . ; ; ; "Analysis and Tracking of Emotions in English and Bengali Texts: A Computational Approach" ; ; "The present discussion highlights the aspects of an ongoing doctoral thesis grounded on the analysis and tracking of emotions from English and Bengali texts. Development of lexical resources and corpora meets the preliminary urgencies. The research spectrum aims to identify the evaluative emotional expressions at word, phrase, sentence, and document level granularities along with their associated holders and topics. Tracking of emotions based on topic or event was carried out by employing sense based affect scoring techniques. The labeled emotion corpora are being prepared from unlabeled examples to cope with the scarcity of emotional resources, especially for the resource constraint language like Bengali. Different unsupervised, supervised and semi-supervised strategies, adopted for coloring each outline of the research spectrum produce satisfactory outcomes" ; ; "March/April" ; "343" ; ; "2011" ; a ; "Analysis and Tracking of Emotions in English and Bengali Texts: A Computational Approach" ; ; , . rdf:_1 ; a rdf:Seq . ; ; ; "Application of Semantic Web Technologies for Multimedia Interpretation" ; ; "Despite numerous outstanding results, highly complex and specialized multimedia algorithms have not been able to fulfill the promise of fully automated multimedia interpretation. An essential problem is that they are insufficiently aware of the context they operate in. Algorithms that do take a form of context in consideration, often function in a domain-specific environment. The generic framework proposed in this paper stimulates algorithm collaboration on an interpretation task by continuously actualizing the context of the multimedia item under interpretation. Semantic Web knowledge, combined with reasoning methods, forms the corner stone of the integration of these various interacting agents. We believe that this framework will enable an advanced interpretation of multimedia data that goes beyond the capabilities of individual algorithms. A basic platform implementation already indicates the potential of the concept, clearing the path for even more complex interpretation scenarios." ; ; "March/April" ; "427" ; ; "2011" ; a ; "Application of Semantic Web Technologies for Multimedia Interpretation" ; ; , . rdf:_1 ; a rdf:Seq . ; ; ; "Computational Advertising: Leveraging User Interaction & Contextual Factors for Improved Ad Retrieval & Ranking" ; ; "Computational advertising, popularly known as Online advertising or Web advertising, refers to finding the most relevant ads matching a particular context on the web. It is a scientific sub-discipline at the intersection of information retrieval, statistical modeling, machine learning, optimization, large scale search and text analysis. The core problem attacked in computational advertising (CA) is of the match making between the ads and the context. Based on the context, CA can be broadly compartmentalized into following three areas: Sponsored search, Contextual advertising and Social advertising. Sponsored search refers to the placement of ads on search results page. Contextual advertising deals with matching advertisements to the third party web pages. We refer the placements of ads on a social networking page, leveraging user's social contacts as social advertising. My research work aims at leveraging various user interactions, ad and advertiser related information and contextual information for these three areas of advertising. The research work focuses on the identification of various factors that contribute in retrieving and ranking the most relevant set of ads that match best with the context. Specifically, information associated with the user, publisher and advertiser is leveraged for this purpose." ; ; "March/April" ; "349" ; ; "2011" ; a ; "Computational Advertising: Leveraging User Interaction & Contextual Factors for Improved Ad Retrieval & Ranking" ; ; , . rdf:_1 ; a rdf:Seq . ; ; , , ; "Cooperative Anti-Spam System Based on Multilayer Agents" ; ; "Spam is unsolicited bulk email which is extremely annoying to the recipients and the ISPs. However, most of the traditional spam filtering methods commonly neglect the bulk character of spam. This paper proposes a model of cooperative anti-spam system based on multilayer agents. We compared our model to the state-of-the-art and found that our model achieved better performance and robustness on several known corpora." ; , , ; "March/April" ; "415" ; ; "2011" ; a ; "Cooperative Anti-Spam System Based on Multilayer Agents" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; ; "Dynamic Learning-Based Mechanism Design for Dependent Valued Exchange Economies" ; ; "Learning private information from multiple strategic agents poses challenge in many Internet applications. Sponsored search auctions, crowdsourcing, Amazon's mechanical turk, various online review forums are examples where we are interested in learning true values of the advertisers or true opinion of the reviewers. The common thread in these decision problems is that the optimal outcome depends on the private information of all the agents, while the decision of the outcome can be chosen only through reported information which may be manipulated by the strategic agents. The other important trait of these applications is their dynamic nature. The advertisers in an online auction or the users of mechanical turk arrive and depart, and when present, interact with the system repeatedly, giving the opportunity to learn their types. Dynamic mechanisms, which learn from the past interactions and make present decisions depending on the expected future evolution of the game, has been shown to improve performance over repeated versions of static mechanisms. In this paper, we will survey the past and current state-of-the-art dynamic mechanisms and analyze a new setting where the agents consist of buyers and sellers, known as exchange economies, and agents having value interdependency, which are relevant in applications illustrated through examples. We show that known results of dynamic mechanisms with independent value settings cannot guarantee certain desirable properties in this new significantly different setting. In the future work, we propose to analyze similar settings with dynamic types and population." ; ; "March/April" ; "397" ; ; "2011" ; a ; "Dynamic Learning-Based Mechanism Design for Dependent Valued Exchange Economies" ; ; , . rdf:_1 ; a rdf:Seq . ; ; ; "Fuzzy Associative Rule-Based Approach for Pattern Mining and Identification and Pattern-Based Classification" ; ; "Associative Classification leverages Association Rule Mining (ARM) to train Rule-based classifiers. The classifiers are built on high quality Association Rules mined from the given dataset. Associative Classifiers are very accurate because Association Rules encapsulate all the dominant and statistically significant relationships between items in the dataset. They are also very robust as noise in the form of insignificant and low-frequency itemsets are eliminated during the mining and training stages. Moreover, the rules are easy-to-comprehend, thus making the classifier transparent. Conventional Associative Classification and Association Rule Mining (ARM) algorithms are inherently designed to work only with binary attributes, and expect any quantitative attributes to be converted to binary ones using ranges, like Age = [25, 60] . In order to mitigate this constraint, Fuzzy logic is used to convert quantitative attributes to fuzzy binary attributes, like Age = Middle-aged , so as to eliminate any loss of information arising due to sharp partitioning, especially at partition boundaries, and then generate Fuzzy Association Rules using an appropriate Fuzzy ARM algorithm. These Fuzzy Association Rules can then be used to train a Fuzzy Associative Classifier. In this paper, we also show how Fuzzy Associative Classifiers so built can be used in a wide variety of domains and datasets, like transactional datasets and image datasets." ; ; "March/April" ; "379" ; ; "2011" ; a ; "Fuzzy Associative Rule-Based Approach for Pattern Mining and Identification and Pattern-Based Classification" ; ; , . rdf:_1 ; a rdf:Seq . ; ; ; "Measurement and Analysis of Cyberlocker Services" ; ; "Cyberlocker Services (CLS) such as RapidShare and Megaupload have recently become popular. The decline of Peer-to-Peer (P2P) file sharing has prompted various services including CLS to replace it. We propose a comprehensive multi-level characterization of the CLS ecosystem. We answer three research questions: (a) what is a suitable measurement infrastructure for gathering CLS workloads; (b) what are the characteristics of the CLS ecosystem; and (c) what are the implications of CLS on Web 2.0 (and the Internet). To the best of our knowledge, this work is the first to characterize the CLS ecosystem. The work will highlight the content, usage, performance, infrastructure, quality of service, and evolution characteristics of CLS." ; ; "March/April" ; "373" ; ; "2011" ; a ; "Measurement and Analysis of Cyberlocker Services" ; ; , . rdf:_1 ; a rdf:Seq . ; ; , , ; "Performance Enhancement of Scheduling Algorithms in Clusters and Grids Using Improved Dynamic Load Balancing Techniques" ; ; "This paper describes the research work done for during PhD study. Cluster computing, grid computing and cloud computing are distributed computing environments (DCEs) widely accepted for the next generation Web based commercial and scientific applications. These applications work around the globally distributed data of petabyte scale that can only be processed by the aggregating the capability of globally distributed resources. The resource management and process scheduling in large scale distributed computing environment are a challenging task. In this research work we have devised new scheduling algorithms and resource management strategies specially designed for the cluster and grid cloud and peer-to-peer computing. The research work finally presented the distributed computing solutions to one scientific and one commercial application viz. e-Learning and data mining." ; , , ; "March/April" ; "391" ; ; "2011" ; a ; "Performance Enhancement of Scheduling Algorithms in Clusters and Grids Using Improved Dynamic Load Balancing Techniques" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; , , ; "Ranked Answer Graph Construction for Keyword Queries on RDF Graphs without Distance Neighbourhood Restriction" ; ; "Abstract--- RDF and RDFS have recently become very popular as frameworks for representing data and meta-data in form of a domain description, respectively. RDF data can also be thought of as graph data. In this paper, we focus on keyword-based querying of RDF data. In the existing approaches for answering such keyword queries, keywords are mapped to nodes in the graph and their neighborhoods are explored to extract subgraph(s) of the data graph that contain(s) information relevant to the query. In order to restrict the computational effort, a fixed distance bound is used to define the neighborhoods of nodes. In this paper we present an elegant algorithm for keyword query processing on RDF data that does not assume such a fixed bound. The approach adopts a pruned exploration mechanism where closely related nodes are identified, subgraphs are pruned and joined using suitable hook nodes. The system dynamically manages the distance depending on the closeness between the keywords. The working of the algorithm is illustrated using a fragment of AIFB institute data represented as an RDF graph." ; , , ; "March/April" ; "361" ; ; "2011" ; a ; "Ranked Answer Graph Construction for Keyword Queries on RDF Graphs without Distance Neighbourhood Restriction" ; , , ; , . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; ; ; "Sentence-Level Contextual Opinion Retrieval" ; ; "Existing opinion retrieval techniques do not provide context-dependent relevant results. Most of the approaches used by state-of-the-art techniques are based on frequency of query terms, such that all documents containing query terms are retrieved, regardless of contextual relevance to the intent of the human seeking the opinion. However, in a particular opinionated document, words could occur in different contexts, yet meet the frequency attached to a certain opinion threshold, thus explicitly creating a bias in overall opinion retrieved. In this paper we propose a sentence-level contextual model for opinion retrieval using grammatical tree derivations and approval voting mechanism. Model evaluation performed between our contextual model, BM25, and language model shows that the model can be effective for contextual opinion retrieval such as faceted opinion retrieval." ; ; "March/April" ; "403" ; ; "2011" ; a ; "Sentence-Level Contextual Opinion Retrieval" ; ; , . rdf:_1 ; a rdf:Seq . ; ; ; "Standing on the Shoulders of Ants: Stigmergy in the Web" ; ; "Stigmergy is a biological term used when discussing insect or swarm behaviour, and describes a model supporting environmental communication separately from artefacts or agents. This phenomenon is demonstrated in the behavior of ants and their food gathering process when following pheromone trails, or similarly termites and their termite mound building process. What is interesting with this mechanism is that highly organized societies are achieved without an apparent management structure. Stigmergic behavior is implicit in the Web where the volume of users provides a self-organizing and self-contextualization of content in sites which facilitate collaboration. However, the majority of content is generated by a minority of the Web participants. A significant contribution from this research would be to create a model of Web stigmergy, identifying virtual pheromones and their importance in the collaborative process. This paper explores how exploiting stigmergy has the potential of providing a valuable mechanism for identifying and analyzing online user behavior recording actionable knowledge otherwise lost in the existing web interaction dynamics. Ultimately this might assist our building better collaborative Web sites." ; ; "March/April" ; "355" ; ; "2011" ; a ; "Standing on the Shoulders of Ants: Stigmergy in the Web" ; ; , . rdf:_1 ; a rdf:Seq . ; ; ; "Summarization of Archived and Shared Personal Photo Collections" ; ; "The volume of personal photos hosted on photo archives and social sharing platforms has been increasing exponentially. It is difficult to get an overview of a large collection of personal photos without browsing though the entire database manually. In this research, we propose a framework to generate representative subset summaries from photo collections hosted on web archives or social networks. We define salient properties of an effective photo summary and model summarization as an optimization of these properties, given the size constraints. We also introduce metrics for evaluating photo summaries based on their information content and the ability to satisfy user's information needs. Our experiments show that our summarization framework performs better than baseline algorithms." ; ; "March/April" ; "421" ; ; "2011" ; a ; "Summarization of Archived and Shared Personal Photo Collections" ; ; , . rdf:_1 ; a rdf:Seq . ; ; ; "The Oxpath to Success in the Deep Web" ; ; "The world wide web provides access to a wealth of data. Collecting and maintaining such large amounts of data necessitates automated processing for extraction, since appropriate automation can perform extraction tasks that would be otherwise infeasible. Modern web interfaces, however, are generally designed primarily for human users, delivering sophisticated interactions through the use of client-side scripting and asynchronous server communication. To this end, we introduce OXPath, a careful extension of XPath that facilitates data extraction from the deep web. OXPath exploits XPath's familiarity and theoretical foundations. OXPath, then, achieves favourable evaluation complexity and optimal page buffering, storing only a constant number of pages for non-recursive queries. Further, OXPath provides a lightweight interface, which is easy to use and embed. This paper outlines the motivation, theoretical framework, current implementation, and preliminary results obtained so far. We conclude with proposed future work on OXPath, including an investigation of how to deploy OXPath efficiently in a highly elastic computing framework (cloud)." ; ; "March/April" ; "409" ; ; "2011" ; a ; "The Oxpath to Success in the Deep Web" ; ; , . rdf:_1 ; a rdf:Seq . ; ; , ; "Towards Liquid Service Oriented Architectures" ; ; "The advent of Cloud computing platforms, and the growing pervasiveness of Multicore processor architectures have revealed the inadequateness of traditional programming models based on sequential computations, opening up many challenges for research on parallel programming models for building distributed, service-oriented systems. More in detail, the dynamic nature of Cloud computing and its virtualized infrastructure pose new challenges in term of application design, deployment and dynamic reconfiguration. An application developed to be delivered as a service in the Cloud has to deal with poorly understood issues such as elasticity, infinite scalability and portability across heterogeneous virtualized environments. In this position paper we define the problem of providing a novel parallel programming model for building application services that can be transparently deployed on multicore and cloud execution environments. To this end, we introduce and motivate a research plan for the definition of a novel programming framework for Web service-based applications. Our vision called \"Liquid Architecture\" is based on a programming model inspired by core ideas tied to the REST architectural style coupled with a self-configuring runtime that allows transparent deployment of Web services on a broad range of heterogeneous platforms, from multicores to clouds." ; , ; "March/April" ; "337" ; ; "2011" ; a ; "Towards Liquid Service Oriented Architectures" ; , ; , . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; ; ; "Wikipedia Vandalism Detection" ; ; "Wikipedia is an online encyclopedia that anyone can access and edit. It has become one of the most important sources of knowledge online and many third party projects rely on it for a wide-range of purposes. The open model of Wikipedia allows pranksters, lobbyists and spammers to attack the integrity of the encyclopedia and this endangers it as a public resource. This is known in the community as vandalism. A plethora of methods have been developed within the Wikipedia and the scientific community to tackle this problem. We have participated in this effort and developed one of the leading approaches. Our research aims to create a fully-working antivandalism system and get it working in the real world." ; ; "March/April" ; "391" ; ; "2011" ; a ; "Wikipedia Vandalism Detection" ; ; , . rdf:_1 ; a rdf:Seq . ; , , , ; , , , ; "A Classification Based Framework for Concept Summarization" ; ; "In this paper we propose a novel classification based framework for finding a small number of images summarizing a concept. Our method exploits metadata information available with the images to get the category information using Latent Dirichlet Allocation. We modify the import vector machine formulation based on kernel logistic regression to solve the underlying classification problem. We show that the import vectors provide a good summary satisfying important properties such as coverage, diversity and balance. Furthermore, the framework allows users to specify desired distributions over category, time etc, that a summary should satisfy. Experimental results show that the proposed method performs better than state-of-the-art summarization methods in terms of satisfying important visual and semantic properties." ; , , , ; "March/April" ; "83" ; ; "2011" ; a ; "A Classification Based Framework for Concept Summarization" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , , , , , ; "A Feature-Pair-Based Associative Classification Approach to Look-Alike Modeling for Conversion-Oriented User-Targeting in Tail Campaigns" ; ; "Online advertising offers significantly finer granularity, which has been leveraged in state-of-the-art targeting methods, like Behavioral Targeting (BT). Such methods have been further complemented by recent work in Look-alike Modeling (LAM) which helps in creating models which are customized according to each advertiser s requirements and each campaign s characteristics, and which show ads to users who are most likely to convert on them, not just click them. In Look-alike Modeling given data about converters and nonconverters, obtained from advertisers, we would like to train models automatically for each ad campaign. Such custom models would help target more users who are similar to the set of converters the advertiser provides. The advertisers get more freedom to define their preferred sets of users which should be used as a basis to build custom targeting models. In behavioral data, the number of conversions (positive class) per campaign is very small (conversions per impression for the advertisers in our data set are much less than 10e 4), giving rise to a highly skewed training dataset, which has most records pertaining to the negative class. Campaigns with very few conversions are called as tail campaigns, and those with many conversions are called head campaigns. Creation of Look-alike Models for tail campaigns is very challenging and tricky using popular classifiers like Linear SVM and GBDT, because of the very few number of positive class examples such campaigns contain. In this paper, we present an Associative Classification (AC) approach to LAM for tail campaigns. Pairs of features are used to derive rules to build a Rule-based Associative Classifier, with the rules being sorted by frequency-weighted log-likelihood ratio (F-LLR). The top k rules, sorted by F-LLR, are then applied to any test record to score it. Individual features can also form rules by themselves, though the number of such rules in the top k rules and the whole rule-set is very small. Our algorithm is based on Hadoop, and is thus very efficient in terms of speed." ; , , , , , ; "March/April" ; "85" ; ; "2011" ; a ; "A Feature-Pair-Based Associative Classification Approach to Look-Alike Modeling for Conversion-Oriented User-Targeting in Tail Campaigns" ; , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; , , , ; , , , , ; "A FineGrained Digestion of News Webpages Through Event Snippet Extraction" ; ; "We describe a framework to digest news webpages in finer granularity: to extract event snippets from contexts. Events are atomic text snippets and a news article is constituted by more than one event snippet. Event Snippet Extraction (ESE) aims to mine these snippets out. The problem is important because its solutions may be applied to many information mining and retrieval tasks. The challenge is to exploit rich features to detect snippet boundaries, including various semantic, syntactic and visual features. We run experiments to present the effectiveness of our approaches." ; , , , , ; "March/April" ; "157" ; ; "2011" ; a ; "A FineGrained Digestion of News Webpages Through Event Snippet Extraction" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , , ; "A Framework for Evaluating Network Measures for Functional Importance" ; ; "Many metrics such as degree, closeness, and PageRank have been introduced to determine the relative importance of a node within a network. The desired function of a network, however, is domain-specific. For example, the robustness can be crucial for a communication network, while efficiency is more preferred for fast spreading of advertisements in viral marketing. The information provided by some widely used measures are often conflicting under such varying demands. In this paper, we present a novel framework for evaluating network metrics regarding typical functional requirements. We also propose an analysis of five well established measures to compare their performance of ranking nodes on functional importance in a real-life network." ; , , ; "March/April" ; "109" ; ; "2011" ; a ; "A Framework for Evaluating Network Measures for Functional Importance" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , , ; "A Kernel Approach to Addressing Term Mismatch" ; ; "This paper addresses the problem of dealing with term mismatch in web search using `blending'. In blending, the input query as well as queries similar to it are used to retrieve documents, the ranking results of documents with respect to the queries are combined to generate a new ranking list. We propose a principled approach to blending, using a kernel method and click-through data. Our approach consists of three elements: a way of calculating query similarity using click-through data, a mixture model for combination of rankings using relevance, query similarity, and document similarity scores, and an algorithm for learning the weights of blending model based on the kernel method. Large scale experiments on web search and enterprise search data sets show that our approach can effectively solve term mismatch problem and significantly outperform the baseline methods of query expansion and heuristic blending." ; , , , ; "March/April" ; "153" ; ; "2011" ; a ; "A Kernel Approach to Addressing Term Mismatch" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , , ; "A Middleware for Securing Mobile Mashups" ; ; "Mashups on traditional desktop devices are a well-known source of security risks. In this paper, we examine how these risks translate to mobile mashups and identify new risks caused by mobile-specific characteristics such as access to device features or offline operation. We describe the design of SCCM, a platform independent approach to handle the various mobile mashup security risks in a consistent and systematic manner. Evaluating an SCCM implementation for Android, we find that SCCM successfully protects against common attacks such as inserting a malicious widget from the outside." ; , , ; "March/April" ; "9" ; ; "2011" ; a ; "A Middleware for Securing Mobile Mashups" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , , , , ; "A Non-Syntactic Approach for Text Sentiment Classification with Stopwords" ; ; "The present approach uses stopwords and the gaps that occur between successive stopwords formed by contentwords as features for sentiment classification." ; , , , , , ; "March/April" ; "137" ; ; "2011" ; a ; "A Non-Syntactic Approach for Text Sentiment Classification with Stopwords" ; , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; , , , ; , , , ; "A Probabilistic Model for Opinionated Blog Feed Retrieval" ; ; "In this poster, we study the problem of Opinionated Blog Feed Retrieval which can be considered as a particular type of the faceted blog distillation introduced by TREC 2009. It is a task of finding blogs not only having a principle and recurring interest in a given topic but also having a clear inclination towards expressing opinions on it. We propose a novel probabilistic model for this task which combines its two factors, topical relevance and opinionatedness, in a unified probabilistic framework. Experiments conducted in the context of the TREC 2009 & 2010 Blog Track show the effectiveness of the proposed model." ; , , , ; "March/April" ; "155" ; ; "2011" ; a ; "A Probabilistic Model for Opinionated Blog Feed Retrieval" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , ; "A Self-Organizing Document Map Algorithm for Large Scale Hyperlinked Data Inspired by Neuronal Migration" ; ; "Web document clustering is one of the research topics that is being pursued continuously due to the large variety of applications. Since Web documents usually have variety and diversity in terms of domains, content and quality, one of the technical difficulties is to find a reasonable number and size of clusters. In this research, we pay attention to SOMs (Self Organizing Maps) because of their capability of visualized clustering that helps users to investigate characteristics of data in detail. The SOM is widely known as a \"scalable\" algorithm because of its capability to handle large numbers of records. However, it is effective only when the vectors are small and dense. Although several research efforts on making the SOM scalable have been conducted, technical issues on scalability and performance for sparse high-dimensional data such as hyperlinked documents still remain. In this paper, we introduce MIGSOM, an SOM algorithm inspired by a recent discovery on neuronal migration. The two major advantages of MIGSOM are its scalability for sparse high-dimensional data and its clustering visualization functionality. In this paper, we describe the algorithm and implementation, and show the practicality of the algorithm by applying MIGSOM to a huge scale real data set: Wikipedia's hyperlink data." ; , ; "March/April" ; "95" ; ; "2011" ; a ; "A Self-Organizing Document Map Algorithm for Large Scale Hyperlinked Data Inspired by Neuronal Migration" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , ; "A Study on the Impact of Product Images on User Clicks for Online Shopping" ; ; "In this paper we study the importance of image based features on the click-through rate (CTR) in the context of a large scale product search engine. Typically product search engines use text based features in their ranking function. We present a novel idea of using image based features, common in the photography literature, in addition to text based features. We used a stochastic gradient boosting based regression model to learn relationships between features and CTR. Our results indicate statistically significant correlations between the image features and CTR. We also see improvements to NDCG and mean standard regression." ; , , ; "March/April" ; "45" ; ; "2011" ; a ; "A Study on the Impact of Product Images on User Clicks for Online Shopping" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , ; "Allocating Inverted Index into Flash Memory for Search Engines" ; ; , ; "March/April" ; "61" ; ; "2011" ; a ; "Allocating Inverted Index into Flash Memory for Search Engines" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , , , ; "An Adaptive Ontology-Based Approach to Identify Correlation Between Publications" ; ; "In this paper, we propose an adaptive ontology-based approach for related paper identification, to meet most researchers' practical needs. By searching ontology, we can return a diverse set of papers that are explicitly and implicitly related to an input paper. Moreover, our approach does not rely on known ontology. Instead, we build and update ontology for a collection with any domain of interest. Being independent from known ontology, our approach is much more adaptive for different domains." ; , , , , ; "March/April" ; "149" ; ; "2011" ; a ; "An Adaptive Ontology-Based Approach to Identify Correlation Between Publications" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , ; "Anytime Algorithm for QoS Web Service Composition" ; ; "The QoS-aware web service composition (WSC) problem aims at the automatic construction of a composite web service with the optimal accumulated QoS value. It is, however, intractable to solve the QoS-aware WSC problem for large scale instances, since the problem corresponds to a global optimization problem. In this paper, we propose a novel anytime algorithm for the QoS-aware WSC problem to identify composite web services with high quality much earlier than an optimal algorithm and the beam stack search." ; , ; "March/April" ; "71" ; ; "2011" ; a ; "Anytime Algorithm for QoS Web Service Composition" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , ; "Automatic Sanitization of Social Network Data to Prevent Inference Attacks" ; ; "As the privacy concerns related to information release in social networks become a more mainstream concern, data owners will need to utilize a variety of privacy-preserving methods of examining this data. Here, we propose a method of data generalization that applies to social networks and present some initial findings for the utility/privacy tradeoff required for its use." ; , ; "March/April" ; "55" ; ; "2011" ; a ; "Automatic Sanitization of Social Network Data to Prevent Inference Attacks" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , , , ; "Automatically Generating Labels Based on Unified Click Model" ; ; "Ground truth labels are one of the most important parts in many test collections for information retrieval. Each label, depicting the relevance between a query-document pair, is usually judged by a human, and this process is time-consuming and labor-intensive. Automatically Generating labels from click-through data has attracted increasing attention. In this paper, we propose a Unified Click Model to predict the multi-level labels, which aims at comprehensively considering the advantages of the Position Models and Cascade Models. Experiments show that the proposed click model outperforms the existing click models in predicting the multi-level labels, and could replace the labels judged by humans for test collections." ; , , , , ; "March/April" ; "59" ; ; "2011" ; a ; "Automatically Generating Labels Based on Unified Click Model" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , , , , , ; "Autopedia: Automatic Domain-Independent Wikipedia Article Generation" ; ; "This paper proposes a general framework, named Autopedia, to generate high-quality wikipedia articles for given concepts in any domains, by automatically selecting the best wikipedia template consisting the sub-topics to organize the article for the input concept. Experimental results on 4,526 concepts validate the effectiveness of Autopedia, and the wikipedia template selection approach which takes into account both the template quality and the semantic relatedness between the input concept and its sibling concepts, performs the best." ; , , , , , ; "March/April" ; "161" ; ; "2011" ; a ; "Autopedia: Automatic Domain-Independent Wikipedia Article Generation" ; , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; , , , ; , ; "Caching Intermediate Result of SPARQL Queries" ; ; "The complexity and growing scale of RDF data has made data management back end the performance bottleneck of Semantic Web applications. Caching is one of the ways that could solve this problem. However, few existing research projects focus on caching in RDF data processing. We present an adaptive caching scheme that caches intermediate result of basic graph pattern SPARQL queries. Benchmark test results are provided to illustrate the effectiveness of our caching scheme." ; , ; "March/April" ; "159" ; ; "2011" ; a ; "Caching Intermediate Result of SPARQL Queries" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , ; "Casting a Web of Trust Over Wikipedia: An Interaction-Based Approach" ; ; "We report in this short paper results on inferring a signed network (a \"web of trust\") from user interactions. On the Wikipedia network of contributors, from a collection of articles in the politics domain and their revision history, we investigate mechanisms by which relationships between contributors - in the form of signed directed links - can be inferred from their interactions. Our preliminary study provides valuable insight into principles underlying a signed network of Wikipedia contributors that is captured by social interaction. We look into whether this network (called hereafter WikiSigned) represents indeed a plausible configuration of link signs. We assess connections to social theories such as structural balance and status, which have already been considered in online communities. We also evaluate on this network the accuracy of a learned predictor for edge signs. Equipped with learning techniques that have been applied before on three explicit signed networks, we obtain good accuracy over the WikiSigned edges. Moreover, by cross training-testing we obtain strong evidence that our network does reveal an implicit signed configuration and that it has similar characteristics to the explicit ones, even though it is inferred from interactions. We also report on an application of the resulting signed network that impacts Wikipedia readers, namely the classification of Wikipedia articles by importance and quality." ; , , ; "March/April" ; "87" ; ; "2011" ; a ; "Casting a Web of Trust Over Wikipedia: An Interaction-Based Approach" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , ; "CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks" ; ; "Kempe et al. (KKT) showed the problem of influence maximization is NP-hard and a simple greedy algorithm guarantees the best possible approximation factor in PTIME. However, it has two major sources of inefficiency. First, finding the expected spread of a node set is #P-hard. Second, the basic greedy algorithm is quadratic in the number of nodes. The first source is tackled by estimating the spread using Monte Carlo simulation or by using heuristics. Leskovec et al. proposed the CELF algorithm for tackling the second. In this work, we propose CELF++ and empirically show that it is 35-55% faster than CELF." ; , , ; "March/April" ; "47" ; ; "2011" ; a ; "CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , ; "Collaborative Classification Over P2P Networks" ; ; "We propose a novel collaborative approach for distributed document classification, combining the knowledge of multiple users for improved organization of data such as individual document repositories or emails. The approach builds on top of a P2P network and outperforms the state of the art approaches in collaborative classification." ; , , ; "March/April" ; "97" ; ; "2011" ; a ; "Collaborative Classification Over P2P Networks" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , ; "Comparative Study of Clustering Techniques for Short Text Documents" ; ; "We compare various document clustering techniques including K-means, SVD-based method and a graph-based approach and their performance on short text data collected from Twitter. We define a measure for evaluating the cluster error with these techniques. Observations show that graph-based approach using affinity propagation performs best in clustering short text data with minimal cluster error." ; , , ; "March/April" ; "111" ; ; "2011" ; a ; "Comparative Study of Clustering Techniques for Short Text Documents" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , ; "Coverage Patterns for Efficient Banner Advertisement Placement" ; ; "In an online banner advertising scenario, an advertiser expects that the banner advertisement should be displayed to certain percentage of web site visitors. In this context, to generate more revenue for a given web site, the publisher has to meet the demands of several advertisers by providing appropriate sets of web pages. To help the publishers and advertisers, in this paper, we propose a model of coverage patterns and a methodology to extract potential coverage patterns by analyzing click stream data. Given web pages of a site, a coverage pattern is a set of web pages visited by a certain percentage of visitors. The proposed approach has the potential to enable the publisher in meeting the demands of several advertisers. The efficiency and advantages of the proposed approach is shown by conducting experiments on real world data sets." ; , , ; "March/April" ; "131" ; ; "2011" ; a ; "Coverage Patterns for Efficient Banner Advertisement Placement" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , , , ; "Detecting Group Review Spam" ; ; "It is well-known that many online reviews are not written by genuine users of products, but by spammers who write fake reviews to promote or demote some target products. Although some existing works have been done to detect fake reviews and individual spammers, to our knowledge, no work has been done on detecting spammer groups. This paper focuses on this task and proposes an effective technique to detect such groups." ; , , , , ; "March/April" ; "93" ; ; "2011" ; a ; "Detecting Group Review Spam" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , ; "Domain-Independent Entity Extraction from Web Search Query Logs" ; ; "Query logs of a Web search engine have been increasingly used as a vital source for data mining. This paper presents a study on large-scale domain-independent entity extraction from search query logs. We present a completely unsupervised method to extract entities by applying pattern-based heuristics and statistical measures. We compare against existing techniques that use Web documents as well as search logs, and show that we improve over the state of the art. We also provide an in-depth qualitative analysis outlining differences and commonalities between these methods." ; , ; "March/April" ; "63" ; ; "2011" ; a ; "Domain-Independent Entity Extraction from Web Search Query Logs" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , ; "Effective Summarization of Large Collections of Personal Photos" ; ; , , ; "March/April" ; "127" ; ; "2011" ; a ; "Effective Summarization of Large Collections of Personal Photos" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , , ; "Efficient Diversification of Search Results Using Query Logs" ; ; "We study the problem of diversifying search results by exploiting the knowledge mined from query logs. Our proposal exploits the presence of different \"specializations\" of queries in query logs to detect the submission of ambiguous/faceted queries, and manage them by diversifying the search results returned in order to cover the different possible interpretations of the query. We present an original formulation of the results diversification problem in terms of an objective function to be maximized that admits the finding of an optimal solution in linear time." ; , , , ; "March/April" ; "17" ; ; "2011" ; a ; "Efficient Diversification of Search Results Using Query Logs" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , , ; "Enhancing Web Search with Entity Intent" ; ; "Web entities, such as documents and hyperlinks, are created for different purposes, or intents. Existing intent-based retrieval methods largely focus on information seekers' intent expressed by queries, ignoring the other side of the problem: web content creators' intent. We argue that understanding why the content was created is also important. In this work, we propose to classify such intents into two broad categories: \"navigational\" and \"informational\". Then we incorporate such intents into traditional retrieval models, and show their effect on ranking performance." ; , , ; "March/April" ; "29" ; ; "2011" ; a ; "Enhancing Web Search with Entity Intent" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , , ; "EntityTagger: Automatically Tagging Entities with Descriptive Phrases" ; ; "We consider the problem of entity tagging: given one or more named entities from a specific domain, the goal is to automatically associate descriptive phrases, referred to as etags (entity tags), to each entity. Consider a product catalog containing product names and possibly short descriptions. For a product in the catalog, say Ricoh G600 Digital Camera, we want to associate etags such as ``water resistant'', ``rugged'' and ``outdoor'' to it, even though its name or description does not mention those phrases. Entity tagging can enable more effective search over entities. We propose to leverage signals in web documents to perform such tagging. We develop techniques to perform such tagging in a domain independent manner while ensuring high precision and high recall." ; , , , ; "March/April" ; "19" ; ; "2011" ; a ; "EntityTagger: Automatically Tagging Entities with Descriptive Phrases" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , ; "Evaluation of Valuable User Generated Content on Social News Web Sites" ; ; "Social news websites have gained significant popularity in the last few years. The participants of such websites are not only allowed to share news links but also to annotate, to evaluate and to comment them. To quantify interestingness and attractiveness of the user-generated content in respect to the original link source we introduce the User Generated Content add-on (UGC_+) index. Based on the definition of UGC_+ we also propose a concept for comparing groups of links filtered by different properties, e.g. authorship or topic-categories. We apply the proposed measure on the Spanish Digg-clone MenÈame." ; , ; "March/April" ; "139" ; ; "2011" ; a ; "Evaluation of Valuable User Generated Content on Social News Web Sites" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , ; "Exploiting Session-Like Behaviors in Tag Prediction" ; ; "In social bookmarking systems, existing methods in tag prediction have shown that the performance of prediction can be significantly improved by modeling users preferences. However, these preferences are usually treated as constant over time, neglecting the temporal factor within users behaviors. In this paper, we study the problem of session-like behavior in social tagging systems and demonstrate that the predictive performance can be improved by considering sessions. Experiments, conducted on three public datasets, show that our session-based method can outperform baselines and two state-of-the-art algorithms significantly." ; , , ; "March/April" ; "167" ; ; "2011" ; a ; "Exploiting Session-Like Behaviors in Tag Prediction" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , ; "Extracting Events and Event Descriptions from Twitter" ; ; "This paper describes methods for automatically detecting events involving known entities from Twitter and understanding both the events as well as the audience reaction to them. We show that NLP techniques can be used to extract events, their main actors and the audience reactions with encouraging results." ; , , ; "March/April" ; "105" ; ; "2011" ; a ; "Extracting Events and Event Descriptions from Twitter" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , ; "Finding Influential Mediators in Social Networks" ; ; "Given a social network, who are the key players controlling the bottlenecks of influence propagation if some persons would like to activate specific individuals? In this paper, we tackle the problem of selecting a set of k mediator nodes as the influential gateways whose existence determines the activation probabilities of targeted nodes from some given seed nodes. We formally define the k-Mediators problem. To have an effective and efficient solution, we propose a three-step greedy method by considering the probabilistic influence and the structural connectivity on the pathways from sources to targets. To the best of our knowledge, this is the first work to consider the k-Mediators problem in networks. Experiments on the DBLP co-authorship graph show the effectiveness and efficiency of the proposed method." ; , , ; "March/April" ; "75" ; ; "2011" ; a ; "Finding Influential Mediators in Social Networks" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , ; "Finding Our Way on the Web: Exploring the Role of Waypoints in Search Interaction" ; ; "Information needs are rarely satisfied directly on search engine result pages. Searchers usually need to click through to search results (landing pages) and follow search trails beyond those pages to fulfill information needs. We use the term waypoints to describe pages visited by searchers between the trail origin (the landing page) and the trail destination. The role that waypoints play in search interaction is poorly understood yet can be vital in determining search success. In this poster we analyze log data to determine the arrangement and function of waypoints, and study how these are affected by variations in information goals. Our findings have implications for understanding search behavior and for the design of interactive search support based on waypoints." ; , ; "March/April" ; "147" ; ; "2011" ; a ; "Finding Our Way on the Web: Exploring the Role of Waypoints in Search Interaction" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , ; "From Actors, Politicians, to CEOs: Domain Adaptation of Relational Extractors Using a Latent Relational Mapping" ; ; "We propose a method to adapt an existing relation extraction system to extract new relation types with minimum supervision. Our proposed method comprises two stages: learning a lower-dimensional projection between different relations, and learning a relational classifier for the target relation type with instance sampling.We evaluate the proposed method using a dataset that contains 2000 instances for 20 different relation types. Our experimental results show that the proposed method achieves a statistically significant macro-average F-score of 62.77. Moreover, the proposed method outperforms numerous baselines and a previously proposed weakly-supervised relation extraction method." ; , , ; "March/April" ; "13" ; ; "2011" ; a ; "From Actors, Politicians, to CEOs: Domain Adaptation of Relational Extractors Using a Latent Relational Mapping" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , ; "Generalized Fact-Finding" ; ; "Once information retrieval has located a document, and information extraction has provided its contents, how do we know whether we should actually believe it? Fact-finders are a state-of-the-art class of algorithms that operate in a manner analogous to Kleinberg's Hubs and Authorities, iteratively computing the trustworthiness of an information source as a function of the believability of the claims it makes, and the believability of a claim as a function of the trustworthiness of those sources asserting it. However, as fact-finders consider only ``who claims what\", they ignore a great deal of relevant background and contextual information. We present a framework for ``lifting\" (generalizing) the fact-finding process, allowing us to elegantly incorporate knowledge such as the confidence of the information extractor and the attributes of the information sources. Experiments demonstrate that leveraging this information significantly improves performance over existing, ``unlifted\" fact-finding algorithms." ; , ; "March/April" ; "99" ; ; "2011" ; a ; "Generalized Fact-Finding" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , ; "Generating Summaries for Ontology Search" ; ; "This poster proposes a novel approach for generating summaries for ontology search. Following previous work, we define ontology summarization as the problem of ranking and selecting RDF sentences, for which we examine three aspects. Firstly, to assess the salience of RDF sentences in an ontology, we devise a bipartite graph model for representing the ontology and analyze random walks on this graph. Secondly, to reflect how an ontology is matched with user needs expressed via keyword queries, we incorporate query relevance into the selection of RDF sentences. Finally, to improve the unity of a summary, we optimize its cohesion in terms of the connections between constituent RDF sentences. We have implemented an online prototype system called Falcons Ontology Search." ; , , ; "March/April" ; "27" ; ; "2011" ; a ; "Generating Summaries for Ontology Search" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , ; "GeoVisualRank: A Ranking Method of Geotagged Images Considering Visual Similarity and Geo-Location Proximity" ; ; , ; "March/April" ; "69" ; ; "2011" ; a ; "GeoVisualRank: A Ranking Method of Geotagged Images Considering Visual Similarity and Geo-Location Proximity" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , , , , ; "Growing Parallel Paths for Entity-Page Discovery" ; ; "In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty member homepage) we seek to find all of the entity-pages of the same type (e.g., all faculty members in the department). To do this, we propose a web structure mining method which grows parallel paths through the web graph and DOM trees. We show that by utilizing these parallel paths we can efficiently discover all entity-pages of the same type. Finally, we demonstrate the accuracy of our method with a case study on various domains." ; , , , , , ; "March/April" ; "145" ; ; "2011" ; a ; "Growing Parallel Paths for Entity-Page Discovery" ; , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; , , , ; , , , ; "Harnessing the Wisdom of Crowds: Video Event Detection Based on Synchronous Comments" ; ; "With the recent explosive growth of the number of videos on the Web, it becomes more important to facilitate users' demand for locating their preferred event clips in the lengthy and voluminous programs. Although there has been a great deal of study on generic event detection in recent years, the performance of existing approaches is still far from satisfactory. In this paper, we propose an integrated framework for general event detection. The key idea is that we utilize the synchronous comments to segment the video into clips with semantic text analysis, while taking into account the relationship between the users who write the comments. By borrowing the power of ``the wisdom of crowds'', we experimentally demonstrate that our approach can effectively detect video events." ; , , , ; "March/April" ; "123" ; ; "2011" ; a ; "Harnessing the Wisdom of Crowds: Video Event Detection Based on Synchronous Comments" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , , , ; "Hierarchical Organization of Unstructured Consumer Reviews" ; ; "In this paper, we propose to organize the aspects of a specific product into a hierarchy by simultaneously taking advantages of domain structure knowledge as well as consumer reviews. Based on the derived hierarchy, we generate a hierarchical organization of the consumer reviews based on various aspects of the product, and aggregate consumer opinions on the aspects. With such hierarchical organization, people can easily grasp the overview of consumer reviews and opinions on various aspects, as well as seek consumer reviews and opinions on any specific aspect by navigating through the hierarchy. We conduct evaluation on two product review data sets: Liu et al.'s data set containing 314 reviews for five products, and our review corpus which is collected from forum Web sites containing 60,786 reviews for five popular products. The experimental results demonstrate the effectiveness of our approach." ; , , , ; "March/April" ; "171" ; ; "2011" ; a ; "Hierarchical Organization of Unstructured Consumer Reviews" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , ; "How to Choose Combinations in a Join of Search Results" ; ; "We present novel measures for estimating the effectiveness of duplication-removal operations over a join of ranked lists. We introduce a duplication-removal approach, namely optimality rank, that outperforms existing approaches, according to the new measures." ; , ; "March/April" ; "119" ; ; "2011" ; a ; "How to Choose Combinations in a Join of Search Results" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , , , ; "HyLiEn: A Hybrid Approach to General List Extraction on the Web" ; ; "We consider the problem of automatically extracting general lists from the web. Existing approaches are mostly depen- dent upon either the underlying HTML markup or the visual structure of the Web page. We present HyLiEn an un- supervised, Hybrid approach for automatic List discovery and Extraction on the Web. It employs general assump- tions about the visual rendering of lists, and the structural representation of items contained in them. We show that our method significantly outperforms existing methods." ; , , , , ; "March/April" ; "35" ; ; "2011" ; a ; "HyLiEn: A Hybrid Approach to General List Extraction on the Web" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , ; "Hypergraph-Based Inductive Learning for Generating Implicit Key Phrases" ; ; "This paper presents a novel approach to generate implicit key phrases which are ignored in previous researches. Recent researches prefer to extract key phrases with semi-supervised transductive learning methods, which avoid the problem of training data. In this paper, based on a transductive learning method, we formulate the phrases in the document as a hypergraph and expand the hypergraph to include implicit phrases, which are ranked by an inductive learning approach. The highest ranked phrases are seen as implicit key phrases, and experimental results demonstrate the satisfactory performance of this approach." ; , ; "March/April" ; "77" ; ; "2011" ; a ; "Hypergraph-Based Inductive Learning for Generating Implicit Key Phrases" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , ; "Identifying Overlapping Communities in Folksonomies or Tripartite Hypergraphs" ; ; "Online folksonomies are modeled as tripartite hypergraphs, and detecting communities from such networks is a challenging and well-studied problem. However, almost every existing algorithm known to us for community detection in hypergraphs assign unique communities to nodes, whereas in reality, nodes in folksonomies belong to multiple overlapping communities e.g. users have multiple topical interests, and the same resource is often tagged with semantically different tags. In this paper, we propose an algorithm to detect overlapping communities in folksonomies by customizing a recently proposed edge-clustering algorithm (that is originally for traditional graphs) for use on hypergraphs." ; , , ; "March/April" ; "39" ; ; "2011" ; a ; "Identifying Overlapping Communities in Folksonomies or Tripartite Hypergraphs" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , ; "Identifying Primary Content From Web Pages and Its Application to Web Search Ranking" ; ; "Web pages are usually highly structured documents. In some documents, content with different functionality is laid out in blocks, some merely supporting the main discourse. In other documents, there may be several blocks of unrelated main content. Indexing a web page as if it were a linear document can cause problems because of the diverse nature of its content. If the retrieval function treats all blocks of the web page equally without attention to structure, it may lead to irrelevant query matches. In this paper, we describe how content quality of different blocks of a web page can be utilized to improve a retrieval function. Our method is based on segmenting a web page into semantically coherent blocks and learning a predictor of segment content quality. We also describe how to use segment content quality estimates as weights in the BM25F formulation. Experimental results show our method improves relevance of retrieved results by as much as 4.5% compared to BM25F that treats the body of a web page as a single section, and by a larger margin of over 9% for difficult queries." ; , ; "March/April" ; "135" ; ; "2011" ; a ; "Identifying Primary Content From Web Pages and Its Application to Web Search Ranking" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , , ; "Influence and Passivity in Social Media" ; ; "The ever-increasing amount of information flowing through Social Media forces the members of these networks to compete for attention and influence by relying on other people to spread their message. A large study of information propagation within Twitter reveals that the majority of users act as passive information consumers and do not forward the content to the network. Therefore, in order for individuals to become influential they must not only obtain attention and thus be popular, but also overcome user passivity. We propose an algorithm that determines the influence and passivity of users based on their information forwarding activity. An evaluation performed with a 2.5 million user dataset shows that our influence measure is a good predictor of URL clicks, outperforming several other measures that do not explicitly take user passivity into account. We demonstrate that high popularity does not necessarily imply high influence and vice-versa." ; , , , ; "March/April" ; "113" ; ; "2011" ; a ; "Influence and Passivity in Social Media" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , ; "Investigating Topic Models for Social Media User Recommendation" ; ; "This paper presents a user recommendation system that recommends to a user new friends having similar interests. We automatically discover users interests using Latent Dirichlet Allocation (LDA), a linguistic topic model that represents users as mixtures of topics. Our system is able to recommend friends for 4 million users with high recall, outperforming existing strategies based on graph analysis." ; , ; "March/April" ; "101" ; ; "2011" ; a ; "Investigating Topic Models for Social Media User Recommendation" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , , , , ; "Is Pay-Per-Click Efficient? An Empirical Analysis of Click Values" ; ; "Current sponsored search auction adopts per-click bidding. It implicitly assumes that an advertiser treats all clicks to be equally valuable. This is not always true in real world situations. Clicks which lead to conversions are definitely more valuable than those fraudulent clicks. In this work , we use post-ad-click behavior to measure a click's value and empirically show that for an advertiser, values of different clicks are highly variant. Thus for many clicks, the advertiser's single bid does not reflect his true valuations. This indicates that the sponsored search system under PPC mechanism is not efficient, or does not always give a slot to the advertiser who needs it most." ; , , , , , ; "March/April" ; "141" ; ; "2011" ; a ; "Is Pay-Per-Click Efficient? An Empirical Analysis of Click Values" ; , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; a rdf:Seq . ; , , , ; , ; "Language Independent Identification of Parallel Sentences Using Wikipedia" ; ; "This paper details a novel classification based approach to identify parallel sentences between two languages in a language independent way. We substitute the required language specific resources by the richly structured multilingual content, Wikipedia. Our approach is particularly useful to extract parallel sentences for under-resourced languages like most Indian and African languages, where resources are not readily available with necessary accuracies. We extract various statistics based on the cross lingual links present in Wikipedia and use them to generate feature vectors for each sentence pair. Binary classification of each pair of sentences into parallel or non-parallel has been done using these feature vectors. We achieved a precision upto 78% which is encouraging when compared to other state-of-art approaches.These results support our hypothesis of using Wikipedia to evaluate the parallel coefficient between sentences that can be used to build bilingual dictionaries." ; , ; "March/April" ; "11" ; ; "2011" ; a ; "Language Independent Identification of Parallel Sentences Using Wikipedia" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , ; "Learning Facial Attributes by Crowdsourcing in Social Media" ; ; "Facial attributes such as gender, race, age, hair style, etc., carry rich information for locating designated persons and pro ling the communities from image/video collections (e.g., surveillance videos or photo albums). For plentiful facial attributes in photos and videos, collecting costly manual annotations for training detectors is time-consuming. We propose an automatic facial attribute detection method by exploiting the great amount of weakly labelled photos in social media. Our work can (1) automatically extract training images from the semantic-consistent user groups and (2) filter out noisy training photos by multiple mid-level features (by voting). Moreover, we introduce a method to harvest less-biased negative data for preventing uneven distribution of certain attributes. The experiments show that our approach can automatically acquire training photos for facial attributes and is on par with that by manual annotations." ; , , ; "March/April" ; "25" ; ; "2011" ; a ; "Learning Facial Attributes by Crowdsourcing in Social Media" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , ; "Learning to Tokenize Web Domains" ; ; "Domain Match is an Internet monetization product offered by web companies like Yahoo! The product offers display of ads and search results, when a user requests a webpage from a domain which is non-existent or does not have any content. This product earns significant amount of advertising revenue for major internet companies like Yahoo! Hence it is an important product receiving millions of queries per day. Domain Match (DM) works by tokenizing the input domains and sub-folders into keywords and then displaying ads and search results queried on the keywords. In this poster, we describe a machine learning based solution, which automatically learns to tokenize new domains, given a training dataset containing a set of domains and their tokenizations. We use positional frequency and parts of speech as features for scoring tokens. Tokens are scored combined using various scoring models. We compare two ways of training the models: a simple gain function based training and a large margin training. Experimental results are encouraging." ; , ; "March/April" ; "129" ; ; "2011" ; a ; "Learning to Tokenize Web Domains" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , , , ; "Leveraging Auxiliary Text Terms for Automatic Image Annotation" ; ; "This paper proposes a novel algorithm to annotate web images by automatically aligning the images with their most relevant auxiliary text terms. First, the DOM-based web page segmentation is performed to extract images and their most relevant auxiliary text blocks. Second, automatic image clustering is used to partition the web images into a set of groups according to their visual similarity contexts, which significantly reduces the uncertainty on the relatedness between the images and their auxiliary terms. The semantics of the visually-similar images in the same cluster are then described by the same ranked list of terms which frequently co-occur in their text blocks. Finally, a relevance re-ranking process is performed over a term correlation network to further refine the ranked term list. Our experiments on a large-scale database of web pages have provided very positive results." ; , , , , ; "March/April" ; "175" ; ; "2011" ; a ; "Leveraging Auxiliary Text Terms for Automatic Image Annotation" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , , , ; "Location Relevance Classification for Travelogue Digests" ; ; "In this paper, we aim to develop a travelogue service to discover and convey various travelogue digests, in form of theme locations and geographical scope to their readers. In this service, theme locations in a travelogue are the core information to discover. Due to the inherent ambiguity of location relevance, we explore the textual (e.g., surrounding words) and geographical (e.g., geographical relationship among locations) features of locations to perform location relevance classification for theme location discovery. Finally, we conduct comprehensive experiments on collected travelogues to evaluate the performance of our location relevance classification technique and demonstrate the effectiveness of the travelogue service." ; , , , ; "March/April" ; "163" ; ; "2011" ; a ; "Location Relevance Classification for Travelogue Digests" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , , , , ; "Measuring the Effectiveness of Display Advertising: A Time Series Approach" ; ; "We develop an approach for measuring the effectiveness of online display advertising at the campaign level. We present a Kalman filtering approach to deseasonalize and estimate the percentage changes of online sales on a daily basis. For this study, we analyze 3828 campaigns for 961 products on the Advertising.com network." ; , , , , ; "March/April" ; "7" ; ; "2011" ; a ; "Measuring the Effectiveness of Display Advertising: A Time Series Approach" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , , , ; "Mining Collective Local Knowledge from Google MyMaps" ; ; "The emerging popularity of location-aware devices and location-based services has generated a growing archive of digital traces of people's activities and opinions in physical space. In this study, we leverage geo-referenced user-generated content from Google MyMaps to discover collective local knowledge and understand the differing perceptions of urban space. Working with the large collection of publicly available, annotation-rich MyMaps data, we propose a highly parallelizable approach in order to merge identical places, discover landmarks, and recommend places. Additionally, we conduct interviews with New York City residents/visitors to validate the quantitative findings." ; , , , ; "March/April" ; "151" ; ; "2011" ; a ; "Mining Collective Local Knowledge from Google MyMaps" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , ; "Mobile Search Pattern Evolution: The Trend and the Impact of Voice Queries" ; ; "In this paper we study the characteristics of search queries submitted from mobile devices using Yahoo! Search for Mobile during a 2 months period in early of 2010, and compare the results with a similar study conducted in late 2007. The major findings include 1) mobile search queries have become much more diverse, and 2) user interest and information needs have been substantially changed at least in some areas of search topics, including adult and local intent queries. In addition we investigate the impact of voice query search interface offered by Yahoo!'s mobile search service. We examine how unstructured spoken queries differ from conventional search queries." ; , ; "March/April" ; "165" ; ; "2011" ; a ; "Mobile Search Pattern Evolution: The Trend and the Impact of Voice Queries" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , ; "Mobile Topigraphy: Large-Scale Tag Cloud Visualization for Mobiles" ; ; "We introduce a new mobile topigraphy system that uses the contour map metaphor to display large-scale tag clouds. We introduce the technical issues for topigraphy, and recent requirements for and developments in mobile interfaces. We also present some applications for our mobile topigraphy system and describe the assessment on two initial applications." ; , ; "March/April" ; "89" ; ; "2011" ; a ; "Mobile Topigraphy: Large-Scale Tag Cloud Visualization for Mobiles" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , ; "Networked Hierarchies for Web Directories" ; ; "The hierarchical nature of existing Web directories, ontologies, and folksonomies, are known to provide meaningful information that guide users and applications. We hypothesize that such hierarchical structures provide richer information if they are further enriched by incorporating additional links besides parents, and siblings, namely, between non-sibling nodes. We call such structure a networked hierarchy. Our empirical results indicate that such a networked hierarchy introduces interesting links between nodes (non-sibling) that otherwise in a hierarchical structure are not evident." ; , ; "March/April" ; "43" ; ; "2011" ; a ; "Networked Hierarchies for Web Directories" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , , ; "On Computing Text-Based Similarity in Scientific Literature" ; ; "This paper addresses computing of similarity among papers using text-based measures. First, we analyze the accuracy of the similarities computed using different parts of a paper, and propose a method of Keyword-Extension, which is very useful when text information is incomplete." ; , , , ; "March/April" ; "169" ; ; "2011" ; a ; "On Computing Text-Based Similarity in Scientific Literature" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , , , ; "On Using the Real-Time Web for News Recommendation & Discovery" ; ; "In this work we propose that the high volumes of data on real-time networks like Twitter can be harnessed as a useful source of recommendation knowledge. We describe Buzzer, a news recommendation system that is capable of adapting to the conversations that are taking place on Twitter. Buzzer uses a content-based approach to ranking RSS news stories by mining trending terms from both the public Twitter timeline and from the timeline of tweets generated by a user's own social graph (friends and followers). We also describe the result of a live-user trial which demonstrates how these ranking strategies can add value to conventional RSS ranking techniques, which are largely recency-based." ; , , , ; "March/April" ; "103" ; ; "2011" ; a ; "On Using the Real-Time Web for News Recommendation & Discovery" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , , ; "OntoWiki Mobile - Knowledge Management in Your Pocket" ; ; "As comparatively powerful mobile computing devices become more common, mobile web applications have started gaining in popularity. Such mobile web applications as Google Mail or Calendar are already in everyday use of millions of people. Some first examples of these applications use Semantic Web technologies and information in the form of RDF (e.g. TripIt). An important feature of these applications is their ability to provide offline functionality with local updates for later synchronization with a web server. The key problem to this is the reconciliation, i.e. the problem of potentially conflicting updates from disconnected clients. In this paper we present an approach for a mobile semantic collaboration platform based on the OntoWiki framework. It allows users to collect instance data and refine the structure knowledge bases on the go. A crucial part of OntoWiki Mobile is the advanced conflict resolution for RDF stores. The approach is based on the EvoPat method for data evolution and ontology refactoring." ; , , ; "March/April" ; "33" ; ; "2011" ; a ; "OntoWiki Mobile - Knowledge Management in Your Pocket" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , ; "Open and Decentralized Access Across Location-Based Services" ; ; "Users now interact with multiple Location-Based Services (LBS) through a myriad set of location-aware devices and interfaces. However, current LBS tend to be centralized silos with ad-hoc APIs, which limits potential for information sharing and reuse. Further, LBS subscriptions and user experiences are not easily portable across devices. We propose a general architecture for providing open and decentralized access to LBS, based on Tiled Feeds - a RESTful protocol for access and interactions with LBS using feeds, and Feed Subscription Management (FSM) - a generalized feed-based service management protocol. We describe two client designs, and demonstrate how they enable standardized access to LBS services, promote information sharing and mashup creation, and offer service management across various types of location-enabled devices." ; , , ; "March/April" ; "79" ; ; "2011" ; a ; "Open and Decentralized Access Across Location-Based Services" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , ; "Personalized Search on Flickr Based on Searcher's Preference Prediction" ; ; "In this paper, we propose a personalized search model to assist users in obtaining interested photos on Flickr, which exploits the favorite marks of the searcher s friends to predict the searcher s preference on the returned photos. The proposed model utilizes a co-clustering method to extract latent interest dimensions from users implicit interests, and employs a discriminative learning method to predict searcher s preference on the returned photos. Preliminary experiments demonstrate the improvement of the proposed model compared to existing one-fit-all methods and a user-based collaborative filtering method." ; , ; "March/April" ; "81" ; ; "2011" ; a ; "Personalized Search on Flickr Based on Searcher's Preference Prediction" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , ; "Predicting Popular Messages in Twitter" ; ; "Social network services have become a viable source of information for users. In Twitter, information deemed important by the community propagates through retweets. Studying the characteristics of such popular messages is important for a number of tasks, such as breaking news detection, personalized message recommendation, viral marketing and others. This paper investigates the problem of predicting the popularity of messages as measured by the number of future retweets and sheds some light on what kinds of factors influence information propagation in Twitter. We formulate the task into a classification problem and study two of its variants by investigating a wide spectrum of features based on the content of the messages, temporal information, metadata of messages and users, as well as structural properties of the users' social graph on a large scale dataset. We show that our method can successfully predict messages which will attract thousands of retweets with good performance." ; , , ; "March/April" ; "57" ; ; "2011" ; a ; "Predicting Popular Messages in Twitter" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , , ; "Query Completion without Query Logs for Song Search" ; ; "We describe a new method for query completion for Bollywood song search without using query logs. Since song titles in non-English languages (Hindi in our case) are mostly present as Roman transliterations of the native script, both the queries and documents have a large number of valid variations. We address this problem by using a Roman to Hindi transliteration engine coupled with appropriate ranking and implementation strategies. Out of 100 test cases, our system could generate the correct suggestion for 91 queries." ; , , , ; "March/April" ; "31" ; ; "2011" ; a ; "Query Completion without Query Logs for Song Search" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , , ; "Ranking in Context-Aware Recommender Systems" ; ; "As context is acknowledged as an important factor that can affect users' preferences, many researchers have worked on improving the quality of recommender systems by utilizing users' context. However, incorporating context into recommender systems is not a simple task in that context can influence users' item preferences in various ways depending on the application. In this paper, we propose a novel method for context-aware recommendation, which incorporates several features into the ranking model. By decomposing a query, we propose several types of ranking features that reflect various contextual effects. In addition, we present a retrieval model for using these features, and adopt a learning to rank framework for combining proposed features. We evaluate our approach on two real-world datasets, and the experimental results show that our approach outperforms several baseline methods." ; , , ; "March/April" ; "65" ; ; "2011" ; a ; "Ranking in Context-Aware Recommender Systems" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , , , , , , ; "Ranking Related Entities for Web Search Queries" ; ; "Entity ranking is a recent paradigm that refers to retrieving and ranking related objects and entities from different structured sources in various scenarios. Entities typically have associated categories and relationships with other entities. In this work, we present an extensive analysis of Web-scale entity ranking, based on machine learned ranking models using an ensemble of pairwise preference models. Our proposed system for entity ranking uses structured knowledge bases, entity relationship graphs and user data to derive useful features to facilitate semantic search with entities directly within the learning to rank framework. The experimental results are validated on a large-scale graph containing millions of entities and hundreds of millions of entity relationships. We show that our proposed ranking solution clearly improves a simple user behavior based ranking model." ; , , , , , , , ; "March/April" ; "67" ; ; "2011" ; a ; "Ranking Related Entities for Web Search Queries" ; , , , , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; rdf:_6 ; rdf:_7 ; rdf:_8 ; a rdf:Seq . ; , , , ; , , , , ; "REACTOR: A Framework for Semantic Relation Extraction and Tagging Over Enterprise Data" ; ; "Relation extraction from Web data has attracted a lot of attention in recent years. However, little work has been done when it comes to relation extraction from enterprise data regardless of the urgent needs to such work in real applications (e.g., E-discovery). In this paper, we propose a novel unsupervised hybrid framework, called REACTOR (abbreviated for a fRamework for sEmantic relAtion extraCtion and Tagging Over enteRprise data). We evaluate REACTOR over a real-world enterprise data set and empirical results show the effectiveness of REACTOR." ; , , , , ; "March/April" ; "121" ; ; "2011" ; a ; "REACTOR: A Framework for Semantic Relation Extraction and Tagging Over Enterprise Data" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , , ; "ReadAlong: Reading Articles and Comments Together" ; ; "We propose a new paradigm for displaying comments: showing comments alongside parts of the article they correspond to. We evaluate the effectiveness of various approaches for this task and show that a combination of bag of words and topic models performs the best." ; , , ; "March/April" ; "125" ; ; "2011" ; a ; "ReadAlong: Reading Articles and Comments Together" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , , , ; "Recommendations for the Long Tail by Term-Query Graph" ; ; "We define a new approach to the query recommendation problem. In particular, our main goal is to design a model enabling the generation of query suggestions also for rare and previously unseen queries. In other words we are targeting queries in the long tail. The model is based on a graph having two sets of nodes: Term nodes, and Query nodes. The graph induces a Markov chain on which a generic random walker starts from a subset of Term nodes, moves along Query nodes, and restarts (with a given probability) only from the same initial subset of Term nodes. Computing the stationary distribution of such a Markov chain is equivalent to extracting the so-called Center-piece Subgraph from the graph associated with the Markov chain itself. Given a query, we extract its terms and we set the restart subset to this term set. Therefore, we do not require a query to have been previously observed for the recommending model to be able to generate suggestions." ; , , , , ; "March/April" ; "15" ; ; "2011" ; a ; "Recommendations for the Long Tail by Term-Query Graph" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , , ; "Rolling Boles, Optimal XML Structure Integrity for Updating Operations" ; ; "While multiple techniques exist to utilize the tree structure of the Extensible Markup Language(XML) regarding integrity checks, they all rely on adaptions of the Merkle Tree: All children are acting as one slice regarding the check-sum of one node with the help of an one-way hash concatenation. This results in postorder traversals regarding the (re-)computation of the integrity structure within modification operations. With our approach we perform nearly in-time updates of the entire integrity structure. We therefore equipped an XHash-based approach with an incremental hash function. This replaces postorder traversals by adapting only the incremental modifications to the check-sums of a node and its ancestors. With experimental results we prove that our approach only generates a constant overhead depending on the depth of the tree while native DOMHash implementations produce an overhead based on the depth and the number of all nodes in the tree. Consequently, our approach called Rolling Boles generates sustainable impact since it facilitates instant integrity updates in constant time." ; , , ; "March/April" ; "49" ; ; "2011" ; a ; "Rolling Boles, Optimal XML Structure Integrity for Updating Operations" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , , , ; "Scalable Spatio-Temporal Knowledge Harvesting" ; ; "Knowledge harvesting enables the automated construction of large knowledge bases. In this work, we made a first attempt to harvest spatio-temporal knowledge from news archives to construct trajectories of individual entities for spatio-temporal entity tracking. Our approach consists of an entity extraction and disambiguation module and a fact generation module which produce pertinent trajectory records from textual sources. The evaluation on the 20 years' New York Times news article corpus showed that our methods are effective and scalable." ; , , , , ; "March/April" ; "143" ; ; "2011" ; a ; "Scalable Spatio-Temporal Knowledge Harvesting" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , , ; "Smart News Feeds for Social Networks Using Scalable Joint Latent Factor Models" ; ; "Social networks such as Facebook and Twitter offer a huge opportunity to tap the collective wisdom (both published and yet to be published) of all the participating users in order to address the information needs of individual users in a highly contextualized fashion using rich user-specific information. Realizing this opportunity, however, requires addressing two key limitations of current social networks: (a) difficulty in discovering relevant content beyond the immediate neighborhood, (b) lack of support for information filtering based on semantics, content source and linkage. We propose a scalable framework for constructing smart news feeds based on predicting user-post relevance using multiple signals such as text content and attributes of users and posts, and various user-user, post-post and user-post relations (e.g. friend, comment, author relations). Our solution comprises of two steps where the first step ensures scalability by selecting a small set of user-post dyads with potentially interesting interactions using inverted feature indexes. The second step models the interactions associated with the selected dyads via a joint latent factor model, which assumes that the user/post content and relationships can be effectively captured by a common latent representation of the users and posts. Experiments on a Facebook dataset using the proposed model lead to improved precision/recall on relevant posts indicating potential for constructing superior quality news feeds." ; , , ; "March/April" ; "73" ; ; "2011" ; a ; "Smart News Feeds for Social Networks Using Scalable Joint Latent Factor Models" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , , , ; "SmartInt: Using Mined Attribute Dependencies to Integrate Fragmented Web Databases" ; ; "Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information about the individual entities that are fragmented over multiple sources. At first blush this is just the inverse of traditional database normalization problem - rather than go from a universal relation to normalized tables, we want to reconstruct the universal relation given the tables (sources). The standard way of reconstructing the entities will involve joining the tables. Unfortunately, because of the autonomous and decentralized way in which the sources are populated, they often do not have Primary Key - Foreign Key relations. While tables do share attributes, direct joins over these shared attributes can result in reconstruction of many spurious entities thus seriously compromising precision. We present a unified approach that supports intelligent retrieval over fragmented web databases by mining and using inter-table dependencies. Experiments with the prototype implementation, SmartInt, show that its retrieval strikes a good balance between precision and recall." ; , , , , ; "March/April" ; "51" ; ; "2011" ; a ; "SmartInt: Using Mined Attribute Dependencies to Integrate Fragmented Web Databases" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , , ; "Spammers' Networks Within Online Social Networks: A Case-Study on Twitter" ; ; "We analyze the strategies employed by contemporary spammers in Online Social Networks (OSNs) by identifying a set of spam-accounts in Twitter and monitoring their link-creation strategies. Our analysis reveals that spammers adopt intelligent `collaborative' strategies of link-formation to avoid detection and to increase the reach of their generated spam, such as forming `spam-farms' and creating large number of links with targeted legitimate users. The observations are verified through the analysis of a giant `spam-farm' embedded within the Twitter OSN." ; , , ; "March/April" ; "41" ; ; "2011" ; a ; "Spammers' Networks Within Online Social Networks: A Case-Study on Twitter" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , , ; "Survivability-Oriented Self-Tuning of Web Systems" ; ; "Running in a highly uncertain and changing environment, Web systems cannot always provide full set of services with optim¨al quality, especially when the workload is high or failures in subsys-tems occur frequently. It is thus desirable to continuously maintain a high satisfaction level of the system value proposition, hereafter survivability assurance, while relaxing/sacrificing certain quality/functional requirements that are not crucial to the survival of the Web systems. In this paper, we propose a requirements-driven self-tuning method for survivability assurance of Web systems. Using a value-based feedback controller plus a requirements-oriented reasoner, our method makes both quality and functional requirements tradeoffs decisions at runtime." ; , , , ; "March/April" ; "23" ; ; "2011" ; a ; "Survivability-Oriented Self-Tuning of Web Systems" ; , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; a rdf:Seq . ; , , , ; , ; "The Freshman Handbook: A Hint for the Server Placement of Social Networks" ; ; "There has been a recent unprecedented increase in the use of Online Social Networks (OSNs) to expand our social life, exchange information and share common interests. Many popular OSNs today attract hundreds of millions of users who share tremendous amount of data on it such as Facebook, Twitter, and Buzz. Given the huge business opportunities OSNs may bring, more and more new social applications has emerged on the Internet. For these newcomers in the social network business, one of the first key decisions to make is to where to deploy the computational resources to best accommodate future client requests. In this work, we aim at providing useful suggests to the new born social network providers (freshman) on the intelligent server placement, by exploring available public information from existing social network communities. In this work, we first propose three scalable server placement strategies for OSNs. Our solution can scalably select server locations among all the possible locations, at the same time reducing the cost for inter-user data sharing." ; , ; "March/April" ; "173" ; ; "2011" ; a ; "The Freshman Handbook: A Hint for the Server Placement of Social Networks" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , , , ; "Timestamp-Based Cache Invalidation for Search Engines" ; ; "We propose a new mechanism to predict stale queries in the result cache of a search engine. The novelty of our approach is in the use of timestamps in staleness predictions. We show that our approach incurs very little overhead on the system while its prediction accuracy is comparable to earlier works." ; , , , , ; "March/April" ; "3" ; ; "2011" ; a ; "Timestamp-Based Cache Invalidation for Search Engines" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , ; "Toward Optimal Vaccination Strategies for Probabilistic Models" ; ; "Epidemic outbreaks such as the recent H1N1 influenza show how susceptible large communities are toward the spread of such outbreaks. The occurrence of a widespread disease transmission raises the question of vaccination strategies that are appropriate and close to optimal. The seemingly different problem of viruses disseminating through email networks, shares a common structure with disease epidemics. While it is not possible to vaccinate every individual during a virus outbreak, due to economic and logistical constraints, fortunately, we can leverage the structure and properties of face-to-face social networks to identify individuals whose vaccination would result in a lower number of infected people. The models that have been studied so far assume that once an individual is infected all its adjacent individuals would be infected with probability 1. However, this assumption is not realistic. In reality, if an individual is infected by a virus, the neighboring individuals would get infected with some probability (depending on the type of the disease and the contact). This modification to the model makes the problem more challenging as the simple version is already NP-complete. Here we consider the following epidemiological model computationally: A number of individuals in the community get vaccinated which makes them immune to the disease. The disease then outbreaks and a number of nodes that are not vaccinated get infected at random. These nodes can transmit the infection to their friends with some probability. In this work we consider the optimization problem in which the number of nodes that get vaccinated is limited to k and our objective is to minimize the number of infected people overall. We design various algorithms that take into account the properties of social networks to select k nodes for vaccination in order to achieve the goal. We perform experiments on a real dataset of 34,546 vertices and 421,578 edges and assess their effectiveness and scalability." ; , ; "March/April" ; "1" ; ; "2011" ; a ; "Toward Optimal Vaccination Strategies for Probabilistic Models" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , ; "Towards Automatic Quality Assurance in Wikipedia" ; ; "Featured articles in Wikipedia stand for high information quality, and it has been found interesting to researchers to analyze whether and how they can be distinguished from \"ordinary\" articles. Here we point out that article discrimination falls far short of writer support or automatic quality assurance: Featured articles are not identified, but are made. Following this motto we compile a comprehensive list of information quality flaws in Wikipedia, model them according to the latest state of the art, and devise one-class classification technology for their identification." ; , , ; "March/April" ; "5" ; ; "2011" ; a ; "Towards Automatic Quality Assurance in Wikipedia" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , ; "Towards Identifying Arguments in Wikipedia Pages" ; ; "Wikipedia is one of the most widely used repositories of human knowledge today, contributed mostly by a few hundred thousand regular editors. In this open environment, inevitably, differences of opinion arise among editors of the same article. Especially for polemical topics such as religion and politics, difference of opinions among editors may lead to intense edit wars in which editors compete to have their opinions and points of view accepted. While such disputes can compromise the reliability of the article (or at least portions of it), they are recorded in the edit history of the articles. We posit that exposing such disputes to the reader, and pointing to the portions of the text where they manifest most prominently can be beneficial in helping concerned readers in understanding such topics. In this paper, we discuss our initial efforts towards the problem of automatic evaluation of extracting controversial points in Wikipedia pages." ; , ; "March/April" ; "117" ; ; "2011" ; a ; "Towards Identifying Arguments in Wikipedia Pages" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , ; "Trust Analysis with Clustering" ; ; "Web provides rich information about a variety of objects. Trustability is a major concern on the web. Truth establishment is an important task so as to provide the right information to the user from the most trustworthy source. Trustworthiness of information provider and the confidence of the facts it provides are inter-dependent on each other and hence can be expressed iteratively in terms of each other. However, a single information provider may not be the most trustworthy for all kinds of information. Every information provider has its own area of competence where it can perform better than others. We derive a model that can evaluate trustability on objects and information providers based on clusters (groups). We propose a method which groups the set of objects for which similar set of providers provide \"good\" facts, and provides better accuracy in addition to high quality object clusters." ; , , ; "March/April" ; "53" ; ; "2011" ; a ; "Trust Analysis with Clustering" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , ; "Understanding the Functions of Business Accounts on Twitter" ; ; "This paper performs an initial exploration of business Twitter accounts in order to start understanding how businesses interact with their users and viceversa. We provide an analysis of business tweet types and topics and show that specific business tweet classes such as deals and events can be reliably identi ed for customer use." ; , ; "March/April" ; "107" ; ; "2011" ; a ; "Understanding the Functions of Business Accounts on Twitter" ; , ; . rdf:_1 ; rdf:_2 ; a rdf:Seq . ; , , , ; , , , , ; "Unsupervised Query Segmentation Using Only Query Logs" ; ; "We introduce an unsupervised query segmentation scheme that uses query logs as the only resource and can effectively capture the structural units in queries. We believe that Web search queries have a unique syntactic structure which is distinct from that of English or a bag-of-words model. The segments discovered by our scheme help understand this underlying grammatical structure. We apply a statistical model based on Hoeffding s Inequality to mine significant word n-grams from queries and subsequently use them for segmenting the queries. Evaluation against manually segmented queries shows that this technique can detect rare units that are missed by our Pointwise Mutual Information (PMI) baseline." ; , , , , ; "March/April" ; "91" ; ; "2011" ; a ; "Unsupervised Query Segmentation Using Only Query Logs" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , , , , ; "Using Complex Network Features for Fast Clustering in the Web" ; ; "Applying graph clustering algorithms in real world networks needs to overcome two main challenges: the lack of prior knowledge and the scalability issue. This paper proposes a novel method based on the topological features of complex networks to optimize the clustering algorithms in real-world networks. More specifically, the features are used for parameter estimation and performance optimization. The proposed method is evaluated on real-world networks extracted from the web. Experimental results show improvement both in terms of Adjusted Rand index values as well as runtime efficiency." ; , , , , ; "March/April" ; "133" ; ; "2011" ; a ; "Using Complex Network Features for Fast Clustering in the Web" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , , , , ; "Web Information Extraction Using Markov Logic Networks" ; ; "In this paper, we consider the problem of extracting structured data from web pages taking into account both the content of individual attributes as well as the structure of pages and sites. We use Markov Logic Networks (MLNs) to capture both content and structural features in a single unified framework, and this enables us to perform more accurate inference. We show that inference in our information extraction scenario reduces to solving an instance of the maximum weight subgraph problem. We develop specialized procedures for solving the maximum subgraph variants that are far more efficient than previously proposed inference methods for MLNs that solve variants of MAX-SAT. Experiments with real-life datasets demonstrate the effectiveness of our approach." ; , , , , ; "March/April" ; "115" ; ; "2011" ; a ; "Web Information Extraction Using Markov Logic Networks" ; , , , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; rdf:_4 ; rdf:_5 ; a rdf:Seq . ; , , , ; , , ; "Web-Scale Entity-Relation Search Architecture" ; ; "Enabling entity search and ranking at Web-scale is fraught with many challenges: annotating the corpus with entities and types, query language design, index design, query processing logic, and answer consolidation. We describe a Web-scale entity search engine we are building to handle over a billion Web pages, over 200,000 types, over 1,500,000 entities, and hundreds of entity annotations per page. We describe the design of compressed, token span oriented indices for entity and type annotations. Our prototype demonstrates the practicality of Web-scale entity-relation search." ; , , ; "March/April" ; "21" ; ; "2011" ; a ; "Web-Scale Entity-Relation Search Architecture" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . ; , , , ; , , ; "WonderWhat: Real-Time Event Determination from Photos" ; ; "How often did you feel disappointed in a foreign country, when you had been craving for participating in authentic native events but miserably ended up with being lost in the crowd, due to ignorance of the local culture? Have you ever imagined that with merely a simple click, a tool can identify the events that are right in front of you? As a step in this direction, in this paper, we propose a system that provides users with information of the public events that they are attending by analyzing in real time their photos taken at the event, leveraging both spatio-temporal context and photo content. To fulfill the task, we designed the system to collect event information, maintain dedicated event database, build photo content model for event types, and rank the final results. Extensive experiments were conducted to prove the effectiveness of each component." ; , , ; "March/April" ; "37" ; ; "2011" ; a ; "WonderWhat: Real-Time Event Determination from Photos" ; , , ; . rdf:_1 ; rdf:_2 ; rdf:_3 ; a rdf:Seq . , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ; ; a ; "Proceedings of the 20th World Wide Web Conference (WWW2011), Hyderabad, India" . , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ; ; a ; "Companion Proceedings of the 20th World Wide Web Conference (WWW2011), Hyderabad, India" . a ; "33Across Inc" ; ; "33Across Inc" . a ; "Academia Sinica" ; ; "Academia Sinica" . a ; "Akamai Technologies" ; ; "Akamai Technologies" . a ; "Alibaba Group R&D" ; ; "Alibaba Group R&D" . a ; "AOL Research" ; , , ; "AOL Research" . a ; "Arizona State University" ; , , , , , ; "Arizona State University" . a ; "AT&T Labs - Research", "AT&T Labs Research" ; , , , , , ; "AT&T Labs - Research", "AT&T Labs Research" . a ; "Barcelona Media - Centre d'Innovaci" ; , ; "Barcelona Media - Centre d'Innovaci" . a ; "Bauhaus-Universität Weimar" ; , , , , , ; "Bauhaus-Universität Weimar" . a ; "Beihang University" ; ; "Beihang University" . a ; "Beihang University China" ; ; "Beihang University China" . a ; "Beijing University of Technology" ; ; "Beijing University of Technology" . a ; "Bilkent University" ; , , , ; "Bilkent University" . a ; "Carnegie Mellon University" ; , , , , , , ; "Carnegie Mellon University" . a ; "Case Western Reserve University" ; , , ; "Case Western Reserve University" . a ; "Chinese Academy of Sciences" ; , , , , , , , ; "Chinese Academy of Sciences" . a ; "City University of Hong Kong" ; ; "City University of Hong Kong" . a ; "Columbia University" ; ; "Columbia University" . a ; "consultant" ; ; "consultant" . a ; "Cornell University" ; , , , , , , , , , , ; "Cornell University" . a ; "CSA, Indian Institute of Science" ; ; "CSA, Indian Institute of Science" . a ; "CSIR Meraka Institute" ; ; "CSIR Meraka Institute" . a ; "CSIR Meraka Institute & North-West University" ; ; "CSIR Meraka Institute & North-West University" . a ; "Dataxu Inc" ; ; "Dataxu Inc" . a ; "National University of Ireland, Galway" ; ; "National University of Ireland, Galway" . a ; "Devi Ahilya University" ; , ; "Devi Ahilya University" . a ; "Duke University" ; , ; "Duke University" . a ; "eBay Inc" ; , , ; "eBay Inc" . a ; "eBay Research Labs" ; , ; "eBay Research Labs" . a ; "École Polytechnique Fédérale de Lausanne" ; ; "École Polytechnique Fédérale de Lausanne" . a ; "eMoksha and Kiirti" ; ; "eMoksha and Kiirti" . a ; "Emory University" ; ; "Emory University" . a ; "Ecole Polytechnique Fédérale de Lausanne" ; ; "Ecole Polytechnique Fédérale de Lausanne" . a ; "Ericsson Research" ; , ; "Ericsson Research" . a ; "ETH Zurich", "ETH Zürich" ; , , , , ; "ETH Zurich", "ETH Zürich" . a ; "Facebook", "Facebook, Inc" ; ; "Facebook", "Facebook, Inc" . a ; "Florida State University" ; , ; "Florida State University" . a ; "FORTH-ICS" ; , , , , , ; "FORTH-ICS" . a ; "Fudan University" ; , , ; "Fudan University" . a ; "FZI Research Center for Information Technology" ; , ; "FZI Research Center for Information Technology" . a ; "Georgetown University" ; ; "Georgetown University" . a ; "Georgia Institute of Technology" ; , , , , , ; "Georgia Institute of Technology" . a ; "Ghent University" ; ; "Ghent University" . a ; "Google", "Google Inc", "Google, Inc" ; , , , , , , , , , , ; "Google", "Google Inc", "Google, Inc" . a ; "Graz University of Technology" ; , ; "Graz University of Technology" . a ; "Graz University of Technology and Know-Center Graz" ; ; "Graz University of Technology and Know-Center Graz" . a ; "Groupon Inc" ; ; "Groupon Inc" . a ; "Hanyang University" ; , , , ; "Hanyang University" . a ; "Harvard University" ; , , , , ; "Harvard University" . a ; "HP Labs", "Hewlett-Packard Laboratories" ; , , , , , , , , , ; "HP Labs", "Hewlett-Packard Laboratories" . a ; "Hong Kong University of Science and Technology" ; , ; "Hong Kong University of Science and Technology" . a ; "Hong Kong Polytechnic University" ; , ; "Hong Kong Polytechnic University" . a ; "HP Lab China" ; ; "HP Lab China" . a ; "HP Labs China" ; , , , ; "HP Labs China" . a ; "IBM Almaden Research Center" ; ; "IBM Almaden Research Center" . a ; "IBM India Research Lab" ; ; "IBM India Research Lab" . a ; "IBM Research" ; , , , , ; "IBM Research" . a ; "IBM Research - India", "IBM Research India", "IBM Research-India" ; , , , , ; "IBM Research - India", "IBM Research India", "IBM Research-India" . a ; "IBM Research Lab" ; , ; "IBM Research Lab" . a ; "IBM Software Group" ; ; "IBM Software Group" . a ; "IBM T.J. Watson Research Center & University of Toronto" ; ; "IBM T.J. Watson Research Center & University of Toronto" . a ; "IBM T. J. Watson Research Center", "IBM T.J. Watson Research Center" ; , , , , , , , , , , , ; "IBM T. J. Watson Research Center", "IBM T.J. Watson Research Center" . a ; "IIIT" ; , ; "IIIT" . a ; "IIIT Bangalore" ; ; "IIIT Bangalore" . a ; "IIIT Hyderabad" ; , ; "IIIT Hyderabad" . a ; "IISc" ; , ; "IISc" . a ; "IIT Bombay" ; , , , ; "IIT Bombay" . a ; "IIT Madras" ; , , ; "IIT Madras" . a ; "IMT" ; ; "IMT" . a ; "Indian Institute of Science" ; , , , , , ; "Indian Institute of Science" . a ; "Indian Institute of Technology" ; , ; "Indian Institute of Technology" . a ; "Indian Institute of Technology, Kanpur" ; , ; "Indian Institute of Technology, Kanpur" . a ; "Indian Institute of Technology Kharagpur" ; , , , , , ; "Indian Institute of Technology Kharagpur" . a ; "Indian Institute of Technology, Madras" ; ; "Indian Institute of Technology, Madras" . a ; "Indian Space Research Organisation" ; , ; "Indian Space Research Organisation" . a ; "Indiana University" ; , , , , , , ; "Indiana University" . a ; "Infosys E & R" ; ; "Infosys E & R" . a ; "INRIA Saclay" ; ; "INRIA Saclay" . a ; "Institute Eurecom" ; ; "Institute Eurecom" . a ; "Institute of Automation, Chinese Academy of Sciences" ; , ; "Institute of Automation, Chinese Academy of Sciences" . a ; "International Institute of Information Technology" ; , , , , ; "International Institute of Information Technology" . a ; "International Institute of Information Technology, Hyderabad" ; , ; "International Institute of Information Technology, Hyderabad" . a ; "Iowa State University" ; ; "Iowa State University" . a ; "ISP RAS" ; , , ; "ISP RAS" . a ; "ISTI-CNR" ; , , , , ; "ISTI-CNR" . a ; "Jadavpur University" ; ; "Jadavpur University" . a ; "Jawaharlal Nehru University" ; ; "Jawaharlal Nehru University" . a ; "Jozef Stefan Institute" ; , ; "Jozef Stefan Institute" . a ; "Karlsruhe Institute of Technology" ; , ; "Karlsruhe Institute of Technology" . a ; "Know-Center Graz" ; ; "Know-Center Graz" . a ; "Konkuk University" ; ; "Konkuk University" . a ; "Korea Advanced Institute of Science and Technology" ; ; "Korea Advanced Institute of Science and Technology" . a ; "L3S Research Center, University of Hannover" ; , , ; "L3S Research Center, University of Hannover" . a ; "Laboratoire PRiSM Université de Versailles" ; ; "Laboratoire PRiSM Université de Versailles" . a ; "Lehigh University" ; , , , , , , ; "Lehigh University" . a ; "LinkedIn" ; , ; "LinkedIn" . a ; "Linknet" ; ; "Linknet" . a ; "Massachusetts Institute of Technology" ; , ; "Massachusetts Institute of Technology" . a ; "Max-Planck Institute Computer Science" ; , , ; "Max-Planck Institute Computer Science" . a ; "Max Planck Institute for Informatics", "Max-Planck Institute for Informatics", "Max-Planck-Institut für Informatik" ; , , , , , , , , , , , , ; "Max Planck Institute for Informatics", "Max-Planck Institute for Informatics", "Max-Planck-Institut für Informatik" . a ; "McGill University" ; , , ; "McGill University" . a ; "Microsoft Bing" ; , ; "Microsoft Bing" . a ; "Microsoft Corp" ; , , , ; "Microsoft Corp" . a ; "Microsoft", "Microsoft Corporation" ; , , , , , ; "Microsoft", "Microsoft Corporation" . a ; "Microsoft Research" ; , , , , , , , , , , , , , , , , , , , , , , , , , , , ; "Microsoft Research" . a ; "Microsoft Research Asia", "Microsoft Research, Asia" ; , , , , , , , , , , , , , , , , , , , , ; "Microsoft Research Asia", "Microsoft Research, Asia" . a ; "Microsoft Research India", "Microsoft Research Lab India", "Microsoft Research india" ; , , , , , , , ; "Microsoft Research India", "Microsoft Research Lab India", "Microsoft Research india" . a ; "Monash University" ; ; "Monash University" . a ; "Nanjing University" ; , , , , ; "Nanjing University" . a ; "Nanyang Technological University" ; , , ; "Nanyang Technological University" . a ; "National Chengchi University" ; ; "National Chengchi University" . a ; "National ICT Australia" ; ; "National ICT Australia" . a ; "National Institute of Advanced Industrial Science and Technology" ; ; "National Institute of Advanced Industrial Science and Technology" . a ; "National Institute of Informatics" ; ; "National Institute of Informatics" . a ; "National Laboratory for Parallel and Distributed Processing" ; ; "National Laboratory for Parallel and Distributed Processing" . a ; "National Taiwan University" ; , , , ; "National Taiwan University" . a ; "National University of Defense Technology" ; , ; "National University of Defense Technology" . a ; "National University of Singapore" ; , , , , , , , ; "National University of Singapore" . a ; "New York University" ; , , , , , , , ; "New York University" . a ; "Nokia Research Center" ; ; "Nokia Research Center" . a ; "North Carolina State University" ; , , ; "North Carolina State University" . a ; "Northeastern University" ; , , , , ; "Northeastern University" . a ; "Northwestern Polytechnical University" ; , ; "Northwestern Polytechnical University" . a ; "NTT Corporation" ; , , , , , , , ; "NTT Corporation" . a ; "oDesk" ; ; "oDesk" . a ; "Ohio State University" ; ; "Ohio State University" . a ; "Patel Group of Institutions" ; ; "Patel Group of Institutions" . a ; "Paul) Hsu" ; ; "Paul) Hsu" . a ; "Peking University" ; , , , , , , , ; "Peking University" . a ; "The Pennsylvania State University" ; , ; "The Pennsylvania State University" . a ; "Politecnico di Milano" ; , , , , , , ; "Politecnico di Milano" . a ; "Polytechnic Institute of New York University" ; , ; "Polytechnic Institute of New York University" . a ; "Princeton University" ; , , , , ; "Princeton University" . a ; "Purdue University" ; , , , ; "Purdue University" . a ; "Queensland University of Technology" ; ; "Queensland University of Technology" . a ; "Renmin University of China" ; ; "Renmin University of China" . a ; "Rutgers University" ; , , , ; "Rutgers University" . a ; "SAP Research" ; , ; "SAP Research" . a ; "Sapienza University of Rome" ; ; "Sapienza University of Rome" . a ; "Semantic Dimension Inc" ; ; "Semantic Dimension Inc" . a ; "Seoul National University" ; , , ; "Seoul National University" . a ; "Shanghai Jiao-Tong University" ; ; "Shanghai Jiao-Tong University" . a ; "Sharif University of Technology" ; ; "Sharif University of Technology" . a ; "Simon Fraser University" ; , , ; "Simon Fraser University" . a ; "Southeast University" ; ; "Southeast University" . a ; "St Petersburg State University" ; ; "St Petersburg State University" . a ; "Stanford", "Stanford University" ; , , , , , ; "Stanford", "Stanford University" . a ; "Stony Brook University" ; ; "Stony Brook University" . a ; "Technion", "Technion - Israel Institute of Technology" ; , , , , , ; "Technion", "Technion - Israel Institute of Technology" . a ; "Télécom ParisTech - LTCI" ; , , ; "Télécom ParisTech - LTCI" . a ; "Telefonica R&D" ; ; "Telefonica R&D" . a ; "The Chinese University of Hong Kong" ; ; "The Chinese University of Hong Kong" . a ; "The Open University" ; ; "The Open University" . a ; "The University of Electro-Communications, Tokyo" ; , ; "The University of Electro-Communications, Tokyo" . a ; "University of Queensland" ; ; "University of Queensland" . a ; "Tsinghua University" ; , , , , , , , , , ; "Tsinghua University" . a ; "Universidad Politécnica de Valencia" ; ; "Universidad Politécnica de Valencia" . a ; "Universidad Técnica Federico Santa María" ; ; "Universidad Técnica Federico Santa María" . a ; "Università degli Studi di Milano" ; , , , ; "Università degli Studi di Milano" . a ; "Università degli Studi Roma Tre" ; , , , , ; "Università degli Studi Roma Tre" . a ; "Università di Pisa" ; ; "Università di Pisa" . a ; "University of Leipzig" ; , , ; "University of Leipzig" . a ; "Universitat Jaume I" ; ; "Universitat Jaume I" . a ; "Université Paris-Sud & CNRS" ; , , ; "Université Paris-Sud & CNRS" . a ; "University College Dublin" ; , , , ; "University College Dublin" . a ; "University of Alberta" ; , ; "University of Alberta" . a ; "Università degli Studi di Bari" ; , ; "Università degli Studi di Bari" . a ; "University of Birmingham" ; ; "University of Birmingham" . a ; "University of British Columbia" ; , , ; "University of British Columbia" . a ; "University of Calgary" ; ; "University of Calgary" . a ; "University of California, Berkeley" ; , ; "University of California, Berkeley" . a ; "University of California, Irvine" ; , , , ; "University of California, Irvine" . a ; "University of California, Los Angeles" ; ; "University of California, Los Angeles" . a ; "University of California, Santa Barbara" ; , , , , , , , , , ; "University of California, Santa Barbara" . a ; "University of California, Santa Cruz" ; , ; "University of California, Santa Cruz" . a ; "University of Cambridge" ; , , ; "University of Cambridge" . a ; "University of Colorado at Boulder" ; , , , , ; "University of Colorado at Boulder" . a ; "University of Edinburgh" ; ; "University of Edinburgh" . a ; "University of Heidelberg" ; , ; "University of Heidelberg" . a ; "University of Illinois" ; , ; "University of Illinois" . a ; "University of Illinois at Chicago" ; , , ; "University of Illinois at Chicago" . a ; "University of Illinois at Urbana-Champaign" ; , , , , , , , , , , , , , , ; "University of Illinois at Urbana-Champaign" . a ; "University of Konstanz" ; , , ; "University of Konstanz" . a ; "University of Lübeck" ; , , ; "University of Lübeck" . a ; "University of Lugano" ; , ; "University of Lugano" . a ; "University of Maryland", "University of Maryland, Baltimore County" ; , , , , , , , ; "University of Maryland", "University of Maryland, Baltimore County" . a ; "University of Massachusetts, Amherst" ; , ; "University of Massachusetts, Amherst" . a ; "University of Michigan" ; ; "University of Michigan" . a ; "University of Michigan, Ann Arbor" ; ; "University of Michigan, Ann Arbor" . a ; "University of Minnesota" ; ; "University of Minnesota" . a ; "University of Minnesota, Twin Cities" ; ; "University of Minnesota, Twin Cities" . a ; "University of Missouri, Kansas City" ; , ; "University of Missouri, Kansas City" . a ; "University of Nankai" ; , , ; "University of Nankai" . a ; "The University of New South Wales" ; , ; "The University of New South Wales" . a ; "University of Nice Sophia Antipolis" ; , , ; "University of Nice Sophia Antipolis" . a ; "University of North Carolina at Charlotte" ; , , ; "University of North Carolina at Charlotte" . a ; "University of North Carolina, Greensboro" ; ; "University of North Carolina, Greensboro" . a ; "University of Oxford" ; , , , , , ; "University of Oxford" . a ; "University of Southern California" ; ; "University of Southern California" . a ; "University of St. Andrews" ; ; "University of St. Andrews" . a ; "The University of Texas at Dallas" ; , ; "The University of Texas at Dallas" . a ; "The University of Tokyo" ; , , , , , , , ; "The University of Tokyo" . a ; "University of Toronto" ; , , , ; "University of Toronto" . a ; "University of Vienna" ; ; "University of Vienna" . a ; "University of Washington" ; , , , ; "University of Washington" . a ; "University of Waterloo" ; , ; "University of Waterloo" . a ; "University of Wisconsin-Madison" ; ; "University of Wisconsin-Madison" . a ; "Vrije Universiteit Amsterdam" ; , ; "Vrije Universiteit Amsterdam" . a ; "Washington University in St. Louis" ; , , ; "Washington University in St. Louis" . a ; "Wesleyan University" ; ; "Wesleyan University" . a ; "Wright State University" ; , , , ; "Wright State University" . a ; "Wuhan University" ; ; "Wuhan University" . a ; "Yahoo", "Yahoo! Inc", "Yahoo! inc" ; , , , , , ; "Yahoo", "Yahoo! Inc", "Yahoo! inc" . a ; "Yahoo! India" ; ; "Yahoo! India" . a ; "Yahoo Labs", "Yahoo! Labs" ; , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ; "Yahoo Labs", "Yahoo! Labs" . a ; "Yahoo! Labs Bangalore" ; ; "Yahoo! Labs Bangalore" . a ; "Yahoo! Labs China" ; ; "Yahoo! Labs China" . a ; "Yahoo! Labs India" ; ; "Yahoo! Labs India" . a ; "Yahoo! Research" ; , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ; "Yahoo! Research" . a ; "Yahoo! Research Barcelona" ; ; "Yahoo! Research Barcelona" . a ; "Yahoo! Software Development India" ; ; "Yahoo! Software Development India" . ; a ; "Abhinav Mishra" ; "Mishra" ; "Abhinav" ; ; "0710462fb97369e598cf0a06725f4077dffed0ec" ; "Abhinav Mishra" . ; a ; "Abraham Bagherjeiran" ; "Bagherjeiran" ; "Abraham" ; ; "1d072b315554893ddf08263bfd757fde0013f551" ; "Abraham Bagherjeiran" . ; a ; "Achille Fokoue" ; "Fokoue" ; "Achille" ; ; "e3523c8a8f912fbe497ddfc49eb91074645c0954" ; "Achille Fokoue" . ; a ; "Adila A. Krisnadhi" ; ; "Adila A. Krisnadhi" . ; a ; "Adish Singla" ; "Singla" ; "Adish" ; ; "8fbdbd843fa1dbeda520d63b5cd1832fb06c85eb" ; "Adish Singla" . ; a ; "Aditi Sharma Grover" ; "Sharma Grover" ; "Aditi" ; ; "f9fbd03e07c2e0088ba9377386d9952c96ce409c" ; "Aditi Sharma Grover" . ; a ; "Adnene Guabtni" ; "Guabtni" ; "Adnene" ; ; "3573ad4422276e82269d9a177dfa23791c6090a0" ; "Adnene Guabtni" . ; a ; "Adwait Ratnaparkhi" ; "Ratnaparkhi" ; "Adwait" ; ; "2e955ab1a38c99afa662a47eb8fdf6b16211bd57" ; "Adwait Ratnaparkhi" . ; ; a ; "Aidan Hogan" ; "Hogan" ; "Aidan" ; "f0b90ef2c9c0b54ace61a36e07ac2abf9a597000" ; "Aidan Hogan" . ; a ; "Aiden Dipple" ; "Dipple" ; "Aiden" ; ; "793d7464e72daaa3b98ff5b37d38b6918cf31207" ; "Aiden Dipple" . , ; a ; "Albert-László Barabási" ; "Barabási" ; "Albert-László" ; ; "d49e1deb57f83bce12588738c21f572292c702ff" ; "Albert-László Barabási" . ; ; a ; "Alejandros Jaimes" ; "Jaimes" ; "Alejandros" ; "5abf585493c482a66e78833112e39f636a9965e7" ; "Alejandros Jaimes" . ; a ; "Alessandro Bozzon" ; "Bozzon" ; "Alessandro" ; ; "6f47dad1854d4d313e42df61a3345f0ae9bf557d" ; "Alessandro Bozzon" . ; a ; "Alessandro Flammini" ; "Flammini" ; "Alessandro" ; ; "5714dcc1c9ab822d1ea5b64f34c04123fc5194c0" ; "Alessandro Flammini" . ; a ; "Alessandro Panconesi" ; "Panconesi" ; "Alessandro" ; ; "61864321dc8b0d270166f982769bc95f47e6c7c7" ; "Alessandro Panconesi" . ; a ; "Alex Smola" ; ; "Alex Smola" . ; a ; "Alexander Boldakov" ; "Boldakov" ; "Alexander" ; ; "ce9b50573e1e6f6c1adb908ed1c4529cf29dd2ec" ; "Alexander Boldakov" . ; ; a ; "Alexander J. Smola" ; "Smola" ; "Alexander" ; ; "622786368e2bef0d3a0460410bb15a09f8158457", "76407a61acbf16588b2809a3117f32bd9a408b7b" ; "Alexander J. Smola" . ; a ; "Alexander Kiyko" ; "Kiyko" ; "Alexander" ; ; "4303aea94e1fcce4e703a5305a1025baed7f5e3f" ; "Alexander Kiyko" . ; a ; "Alice Chen" ; "Chen" ; "Alice" ; ; "6d88acbbd338b28787ef034595b032f0de98ca39" ; "Alice Chen" . , ; a ; "Alpa Jain" ; "Jain" ; "Alpa" ; , ; "8ed94a1c57a4da86fcaf15a014ec5e3f74f86153" ; "Alpa Jain" . ; a ; "Amin Sayedi" ; "Sayedi" ; "Amin" ; ; "f8120dd554b934a5b0b24d950baf93618d456212" ; "Amin Sayedi" . ; a ; "Amit Goyal" ; "Goyal" ; "Amit" ; ; "eb701b9fbeda9312f2be65f5f4de1afa4f223f30" ; "Amit Goyal" . ; a ; "Amit Madaan" ; "Madaan" ; "Amit" ; ; "1e8f8ebe70240c409356cdbe24ffefa92f5e43ef" ; "Amit Madaan" . ; ; a ; "Amit Sheth" ; "Sheth" ; "Amit" ; "1d3236fe9a124dc05c6478b68ab10809859ba579" ; "Amit Sheth" . ; ; a ; "Amr Ahmed" ; "Ahmed" ; "Amr" ; ; "75b7f0d5c6dcd7295fd443100d1e89b1d75e4a21" ; "Amr Ahmed" . ; ; a ; "Amr El Abaddi" ; "El Abaddi" ; "Amr" ; "753d436130c9d99c1c22e53863e1217f933131f9" ; "Amr El Abaddi" . ; a ; "Amr El Abbadi" ; "El Abbadi" ; "Amr" ; ; "753d436130c9d99c1c22e53863e1217f933131f9" ; "Amr El Abbadi" . ; a ; "Ana-Maria Popescu" ; "Popescu" ; "Ana-Maria" ; , ; "fce7123453c62e92c04ac538864d53b5fc999b6c" ; "Ana-Maria Popescu" . ; a ; "Anastasios Kementsietsidis" ; "Kementsietsidis" ; "Anastasios" ; , ; "3e855d1b3daa6470e8ec40ebfd7a318ccd8ecd29" ; "Anastasios Kementsietsidis" . ; ; a ; "Andreas Harth" ; "Harth" ; "Andreas" ; "b1ed4e5aa676078cbc65fa15cc6dff2906a524e1" ; "Andreas Harth" . ; a ; "Andreas Kaltenbrunner" ; "Kaltenbrunner" ; "Andreas" ; ; "a5839b527d051f341315aeb7ed72d539e16f5b00" ; "Andreas Kaltenbrunner" . ; a ; "Andreas Schleifer" ; "Schleifer" ; "Andreas" ; ; "81494d45c1a63521a045bbdc2f7a6470f0703ff6" ; "Andreas Schleifer" . ; a ; "Andrei Broder" ; "Broder" ; "Andrei" ; ; "9dcb6577981dc2a74242d075f7663d0e08906d5b" ; "Andrei Broder" . ; a ; "Andrew O. Hatch" ; "Hatch" ; "Andrew" ; ; "a45fda58f64cbbf0562e6eb5062095771480a95d" ; "Andrew O. Hatch" . ; a ; "Andrew Sellers" ; , ; "Andrew Sellers" . ; ; a ; "Andrew Tomkins" ; "Tomkins" ; "Andrew" ; "3a53a99eab48b117f154a4e84dce7365dcc4a838" ; "Andrew Tomkins" . ; a ; "Andrey Sysoev" ; "Sysoev" ; "Andrey" ; ; "f9e2f38114430a6d5221fea4ee404af017a8ce36" ; "Andrey Sysoev" . ; a ; "Angshu Rai" ; "Rai" ; "Angshu" ; ; "3527cb4f758fe454bf8abfb5e9a829f044db3781" ; "Angshu Rai" . ; a ; "Aniket Mahanti" ; "Mahanti" ; "Aniket" ; ; "0deaaf6bb9ab4528a556ba0852ea7f189eab3f1a" ; "Aniket Mahanti" . ; a ; "Aniket Rangrej" ; "Rangrej" ; "Aniket" ; ; "7656069df4a46c7b21e8084a851abc906e9f3110" ; "Aniket Rangrej" . ; a ; "Anindya Ghose" ; "Ghose" ; "Anindya" ; , ; "a9188fc8a6b83be0e6b30eb5839e22233cb8a7bc" ; "Anindya Ghose" . ; a ; "Anitha Kannan" ; "Kannan" ; "Anitha" ; ; "db0bf2797370cfc3cb4fe6cc369d7cd38fcfe671" ; "Anitha Kannan" . ; a ; "Anjan Goswami" ; "Goswami" ; "Anjan" ; ; "6f1bc8bdc63bd69b220cee542cdd263b3f331db2" ; "Anjan Goswami" . ; a ; "Anthony Ventresque" ; "Ventresque" ; "Anthony" ; ; "58f2b0459340725d719f8c37c6f26b2b046bb1a3" ; "Anthony Ventresque" . ; a ; "Anton Bakalov" ; "Bakalov" ; "Anton" ; ; "5a7c776c83ea7854636ce6e135ebb83016d309d0" ; "Anton Bakalov" . ; a ; "Anupam Joshi" ; "Joshi" ; "Anupam" ; ; "73030e2992f4844d9815623c1ea8e839a6cdc2da" ; "Anupam Joshi" . ; a ; "Anupam Khulbe" ; "Khulbe" ; "Anupam" ; ; "5fc413f5af123d810dc883e20943e1f0937fa980" ; "Anupam Khulbe" . ; a ; "Anwitaman Datta" ; "Datta" ; "Anwitaman" ; ; "dc84b49fa6369eda880fd7fa29c9d318e9401da1" ; "Anwitaman Datta" . ; a ; "Aravind Kalavagattu" ; "Kalavagattu" ; "Aravind" ; ; "ff7cf1196a5efa02a41be3758fc98c3ac3da7410" ; "Aravind Kalavagattu" . ; a ; "Ariel Fuxman" ; "Fuxman" ; "Ariel" ; ; "8c519bf2ff2bc0f65441384534c5779a6959fa91" ; "Ariel Fuxman" . ; a ; "Aristides Gionis" ; "Gionis" ; "Aristides" ; ; "5b1f4e587eb604bc5ba0402c50c0a48e8214415b" ; "Aristides Gionis" . ; a ; "Arjun Mukherjee" ; "Mukherjee" ; "Arjun" ; ; "700087110b450b40113f9e243e2f2efc0687b1ea" ; "Arjun Mukherjee" . ; a ; "Arnab Bhattacharya" ; "Bhattacharya" ; "Arnab" ; ; "f46c65e210bb9d9f9d87cb9a5050460ee52900ca" ; "Arnab Bhattacharya" . ; a ; "Arpita Ghosh" ; "Ghosh" ; "Arpita" ; ; "bace7acc1a5021b17e509484118d69b65e82ba22" ; "Arpita Ghosh" . ; a ; "Arun Kumar" ; ; "Arun Kumar" . ; a ; "Arvind Krishnamurthy" ; "Krishnamurthy" ; "Arvind" ; ; "a73692de93b073b749119dcc32052127b7b667ef" ; "Arvind Krishnamurthy" . , ; a ; "Ashish Mangalampalli" ; "Mangalampalli" ; "Ashish" ; , ; "80dc1b34cf658cea1deae279d13bced66680ce5b" ; "Ashish Mangalampalli" . ; a ; "Ashish V. Tendulkar" ; "Tendulkar" ; "Ashish" ; ; "c957d553b008f30378d0823f4f2cab01c7fb50e8" ; "Ashish V. Tendulkar" . ; ; a ; "Ashok Jhunjhunwala" ; "Jhunjhunwala" ; "Ashok" ; "4097c98cf1ee1ef6d350c8a00edd78fa3ef6269f" ; "Ashok Jhunjhunwala" . ; a ; "Ashok Kumar Ponnuswami" ; "Ponnuswami" ; "Ashok Kumar" ; ; "a9d9ce8dd709e4eb86eb37638212d4e4edad9d49" ; "Ashok Kumar Ponnuswami" . ; a ; "Ashok Veilumuthu" ; "Veilumuthu" ; "Ashok" ; ; "ee82768885f14c5352010b5d4cb8e3e1bb193632" ; "Ashok Veilumuthu" . ; a ; "Ashwin Machanavajjhala" ; "Machanavajjhala" ; "Ashwin" ; ; "2fb85983f1fee6e6f1a376166f2016f24bc3b655" ; "Ashwin Machanavajjhala" . ; a ; "Aurélien Francillon" ; "Francillon" ; "Aurelien" ; ; "9ec47cadea32639c25ab048891ccf8e2f46f80e0" ; "Aurélien Francillon" . ; a ; "Avanthi Krishnamurthy" ; "Krishnamurthy" ; "Avanthi" ; ; "279f04984d2bfb206638317a9994a8e2e52d10e3" ; "Avanthi Krishnamurthy" . ; a ; "Azin Ashkan" ; "Ashkan" ; "Azin" ; ; "75551fadef8e470cca8983101c7e0a88f89c3ed5" ; "Azin Ashkan" . ; a ; "B. Barla Cambazoglu" ; "Cambazoglu" ; "B. Barla" ; ; "b45fcfa0d58ac6ed2f8a7251ad2dc4814058e97e" ; "B. Barla Cambazoglu" . ; a ; "Barbara Panicucci" ; "Panicucci" ; "Barbara" ; ; "0a3ce7e92fb8eea5d71d37824681294b3ec72fc2" ; "Barbara Panicucci" . , ; a ; "Barbara Poblete" ; "Poblete" ; "Barbara" ; ; "e2b5112a48342f866d6d7acaa57f0f2c5265ca98" ; "Barbara Poblete" . ; a ; "Barry Smyth" ; "Smyth" ; "Barry" ; ; "200d990550c9782a58811ecd136a4fd10a2ebf2d" ; "Barry Smyth" . ; a ; "Beibei Li" ; "Li" ; "Beibei" ; , ; "ae43d027c881e768fc8a272e3f186bfe077fa745" ; "Beibei Li" . ; a ; "Benjamin Bach" ; "Bach" ; "Benjamin" ; ; "86c2126a22022f883e7333a88f9c42632fd0cf9f" ; "Benjamin Bach" . ; a ; "Benjamin E. Teitler" ; "Teitler" ; "Benjamin" ; ; "ee5458973c6e4f05e49d3c486966c05bf7576068" ; "Benjamin E. Teitler" . ; a ; "Benno Stein" ; "Stein" ; "Benno" ; , ; "49b228f1e8cbe345ca23d8b26309b908504fc487" ; "Benno Stein" . ; a ; "Benoit Dumoulin" ; "Dumoulin" ; "Benoit" ; ; "421934d59609be2c0d61ca9877443acc990ef8ee" ; "Benoit Dumoulin" . ; a ; "Bernard Renger" ; "Renger" ; "Bernard" ; ; "e6082d31b395a701afe0e887a5162aa02465d85e" ; "Bernard Renger" . ; a ; "Bernardo A. Huberman" ; "Huberman" ; "Bernardo" ; ; "219ff2d71b9170082c6221fe30a0ee783a421dc6" ; "Bernardo A. Huberman" . ; a ; "Beth Brownholtz" ; "Brownholtz" ; "Beth" ; ; "b7121a83237375aeecc52d894e415183cca33e3b" ; "Beth Brownholtz" . ; a ; "Bhaskar Ghosh" ; "Ghosh" ; "Bhaskar" ; ; "ad66f6f9e238547b9db4b868b1271cd69b36ee7b" ; "Bhaskar Ghosh" . ; a ; "Bihuan Chen" ; "Chen" ; "Bihuan" ; ; "d466653efbddbd4603f995b821dc49e7b04fa28c" ; "Bihuan Chen" . ; ; a ; "Bin Gao" ; "Gao" ; "Bin" ; "0dc951aa566ab021ec80e7c5e0f519806b64dd1c" ; "Bin Gao" . ; a ; "Bin Yang" ; "Yang" ; "Bin" ; ; "18b47e8c5dd46a93595bf9c0e5986c514578547a" ; "Bin Yang" . ; a ; "Bing Liu" ; "Liu" ; "Bing" ; ; "780b3bcfab2daf2e7157ac7a169a283024d06ea4" ; "Bing Liu" . ; a ; "Bo-June" ; ; "Bo-June" . ; a ; "Bo-June Paul Hsu" ; "Hsu" ; "Bo-June", "Bo-June (Paul)" ; ; "769def65bd5cd6b6137bb326fef87807e5b12aaa" ; "Bo-June Paul Hsu" . ; a ; "Bo Long" ; "Long" ; "Bo" ; ; "a8f6dfa74f604c966a9489fdcba08b14945d83c4" ; "Bo Long" . ; a ; "Bo Pang" ; "Pang" ; "Bo" ; ; "79826ab67755567d9e6f9f5ab136757d398c0899" ; "Bo Pang" . ; a ; "Bogdan Cautis" ; "Cautis" ; "Bogdan" ; ; "90c18a309404794ad75a39a4fed2a30884197f8d" ; "Bogdan Cautis" . ; a ; "Bojun Huang" ; "Huang" ; "Bojun" ; ; "a5f2084f372752fdc3294b6ad64caf8a3624dd49" ; "Bojun Huang" . ; a ; "Boriz Katz" ; "Katz" ; "Boriz" ; ; "bc3157b3ec92a82bf0c2e0e16bee823e3ade78d1" ; "Boriz Katz" . , ; a ; "Botao Hu" ; "Hu" ; "Botao" ; , ; "b4d53733cf3dc3a17d2b4de09dadf1d8c27e7c16" ; "Botao Hu" . ; a ; "Boualem Benatallah" ; "Benatallah" ; "Boualem" ; ; "1a468cd4f42832a2f8b22df23ceb9960746ba897" ; "Boualem Benatallah" . ; a ; "Brad Null" ; "Null" ; "Brad" ; ; "d7777a12c22f45c62adb36a3150bf4143bccfa25" ; "Brad Null" . ; a ; "Brandyn White" ; "White" ; "Brandyn" ; ; "0bcd03653694ab8653e27a8c2bf989d72bb96a48" ; "Brandyn White" . ; a ; "Brendan Meeder" ; "Meeder" ; "Brendan" ; , ; "70116718db981a5adcfab16a4b3edb1bfe7b0322" ; "Brendan Meeder" . ; a ; "Brian D. Davison" ; "Davison" ; "Brian" ; , , ; "2f51e45fdc669661adcc91558a87494d4109d155", "696cc3cf25f799829253058e00dd4eba409d19d0" ; "Brian D. Davison" . ; a ; "Brian Davison" ; "Davison" ; "Brian" ; ; "2f51e45fdc669661adcc91558a87494d4109d155" ; "Brian Davison" . ; a ; "Brian Karrer" ; "Karrer" ; "Brian" ; ; "65428ce07100e4ca9b2a2db078d800d73694e2f8" ; "Brian Karrer" . ; a ; "Bruno Gonçalves" ; "Gonçalves" ; "Bruno" ; ; "b787bde8e8a57ae64808b2862d9cecc51f74506f" ; "Bruno Gonçalves" . ; a ; "C. E. Veni Madhavan" ; ; "C. E. Veni Madhavan" . ; a ; "Carl Lagoze" ; "Lagoze" ; "Carl" ; ; "1c43283a3286c1de59d7e1f0542a674f6f5c9074" ; "Carl Lagoze" . ; a ; "Carlos Castillo" ; "Castillo" ; "Carlos" ; ; "379f3f4670f33f367171e2115c9424d8441453b5" ; "Carlos Castillo" . ; ; a ; "Carolina Fortuna" ; "Fortuna" ; "Carolina" ; "df2a00e9a21b3bb7419ae8778c5617070da25334" ; "Carolina Fortuna" . ; a ; "Casey Dugan" ; "Dugan" ; "Casey" ; ; "050bda128e0de39cb5c63fcb178b9aebf20c7fba" ; "Casey Dugan" . ; a ; "Cecilia Mascolo" ; "Mascolo" ; "Cecilia" ; ; "7606221c486edb8be34873e6ae2428687f7eab83" ; "Cecilia Mascolo" . ; a ; "Ceren Budak" ; "Budak" ; "Ceren" ; ; "564efe44eb18444a2a2e43c7718491c8650ba889" ; "Ceren Budak" . ; a ; "Cesare Pautasso" ; "Pautasso" ; "Cesare" ; ; "10449435c7a573992b3e49fa4a72432574952b77" ; "Cesare Pautasso" . ; a ; "Changsung Kang" ; "Kang" ; "Changsung" ; ; "ed8a5521be1a8df528ff8510de8d7e0615b82794" ; "Changsung Kang" . ; a ; "Chao Liu" ; "Liu" ; "Chao" ; ; "8d47bb3b3739c0160a90562434472a510145a17c" ; "Chao Liu" . , ; a ; "Chaoming Song" ; "Song" ; "Chaoming" ; ; "20ab8a29d6c60787b5740d2c48d216c9d3564577" ; "Chaoming Song" . ; a ; "Charles L. A. Clarke" ; "Clarke" ; "Charles" ; ; "282d49b4439f81a16787767a2b8462464a73d50a" ; "Charles L. A. Clarke" . ; a ; "Charu Aggarwal" ; "Aggarwal" ; "Charu" ; ; "c75d4324b843295254dda7bc66651d1e5dffee81" ; "Charu Aggarwal" . ; a ; "Cheng-Te Li" ; "Li" ; "Cheng-Te" ; ; "72dbcd662f957695e1746818b2c22b4ca4fb2691" ; "Cheng-Te Li" . ; a ; "ChengXiang Zhai", "Chengxiang Zhai" ; "Zhai" ; "ChengXiang", "Chengxiang" ; , ; "5bad5e02a6dc9f617c275513d1622cae94b26335" ; "ChengXiang Zhai", "Chengxiang Zhai" . ; a ; "Ching-Yung Lin" ; "Lin" ; "Ching-Yung" ; ; "b32ce93fa15b6ae0505541ca18ba9c7b9b2716ca" ; "Ching-Yung Lin" . ; a ; "Chiranjib Bhattacharyya" ; "Bhattacharyya" ; "Chiranjib" ; ; "047c8a861ee44ac71295e8327e690449582a6f5c" ; "Chiranjib Bhattacharyya" . ; a ; "Choon Hui Teo" ; "Teo" ; "Choon Hui" ; ; "3403b20b2a977ac91777b29ed33dd60a29fa5b0c" ; "Choon Hui Teo" . ; a ; "Christian Borgs" ; "Borgs" ; "Christian" ; ; "2151e0a8020649662ef6a071991796dcdb45af06" ; "Christian Borgs" . ; a ; "Christian Schallhart" ; "Schallhart" ; "Christian" ; ; "f7bf5b39633605f8398a65423746eae70dca2a88" ; "Christian Schallhart" . ; a ; "Christian Seifert" ; "Seifert" ; "Christian" ; ; "d9cba9798f8c2ced955639a94bda75cd52593928" ; "Christian Seifert" . ; a ; "Christian Sengstock" ; "Sengstock" ; "Christian" ; ; "07a33c37ac3d18b826652db88e14bc0568896de2" ; "Christian Sengstock" . ; a ; "Christof Bräutigam" ; "Bräutigam" ; "Christof" ; ; "34f03267d8b4b46ab6bb2ebd632f31cc97fcc489" ; "Christof Bräutigam" . ; a ; "Christoph Trattner" ; "Trattner" ; "Christoph" ; ; "d9814241b0a9070508ac7f0b82809e101f85850e" ; "Christoph Trattner" . ; a ; "Christopher J. C. Burges" ; "Burges" ; "Christopher" ; ; "0618bf3a8869346985b0bd9ac78e8034b39b343d" ; "Christopher J. C. Burges" . ; a ; "Christopher Kruegel" ; "Kruegel" ; "Christopher" ; ; "09afb27021868f60657905b5695e91c14e1de8e8" ; "Christopher Kruegel" . ; a ; "Christopher Olston" ; "Olston" ; "Christopher" ; ; "d6f02b7d2ad7e9254669702dd3d7be1adbb99557" ; "Christopher Olston" . ; a ; "Christopher Thrasher" ; "Thrasher" ; "Christopher" ; ; "57796ea337a8969bcee1909525b2c16511912808" ; "Christopher Thrasher" . ; a ; "Chung H. Sung" ; "Sung" ; "Chung" ; ; "92a22f66d81691a72a7680f85020a0aa24bfee6d" ; "Chung H. Sung" . ; a ; "Chunyang Ye" ; "Ye" ; "Chunyang" ; ; "81496d56afab7ba46c2817fb1c8a64bb897d5574" ; "Chunyang Ye" . ; a ; "Cindy Xide Lin" ; "Lin" ; "Cindy Xide" ; ; "39161bb4720f58274ec21b6e97f22c853c27812c" ; "Cindy Xide Lin" . ; a ; "Conglei Yao" ; "Yao" ; "Conglei" ; , ; "e96a1691c83057a4de1c41d89954a6437d979095" ; "Conglei Yao" . ; a ; "Cristian Danescu-Niculescu-Mizil" ; "Danescu-Niculescu-Mizil" ; "Cristian" ; ; "eb87baf9330deaf1961c7c80edbadfdf8303b59f" ; "Cristian Danescu-Niculescu-Mizil" . ; a ; "D. Sivakumar" ; "Sivakumar" ; "D." ; ; "358b2ae323af341d7d879f6c6da7d4fb364629a6" ; "D. Sivakumar" . ; a ; "Dakan Wang" ; "Wang" ; "Dakan" ; ; "2a2a5de854be3f30c1a752a4d9f9d93cc973aa06" ; "Dakan Wang" . ; a ; "Dan Cosley" ; "Cosley" ; "Dan" ; ; "fc2e34bef6e86bfb39c317096e32afa75a1482cd" ; "Dan Cosley" . ; a ; "Dan Roth" ; "Roth" ; "Dan" ; ; "f2f905b2453a0ffca1ffbb520f11bfc12f845ae3" ; "Dan Roth" . ; a ; "Daniel M. Romero" ; "Romero" ; "Daniel" ; , ; "a4add2198f38fbe71ee5791b820b6ef0abcf9985" ; "Daniel M. Romero" . ; a ; "Daniele Bonetta" ; "Bonetta" ; "Daniele" ; ; "46ccbecf28906f528cfb6f9d9ee331168b4f4363" ; "Daniele Bonetta" . ; a ; "Danilo Ardagna" ; "Ardagna" ; "Danilo" ; ; "b18ee88e359d24ece51eca469c97591784204ae5" ; "Danilo Ardagna" . ; a ; "Danushka Bollegala" ; "Bollegala" ; "Danushka" ; ; "5e68aa3636838d2b5658429f17f67b4288b136b3" ; "Danushka Bollegala" . ; a ; "Darko Anicic" ; "Anicic" ; "Darko" ; ; "9d1a6e2aeb44155f89001fc2fdfe044290fec305" ; "Darko Anicic" . , ; a ; "Dashun Wang" ; "Wang" ; "Dashun" ; ; "d0b296c64bfbf39c359373caa458d66cc424b1a6" ; "Dashun Wang" . ; ; a ; "David Carmel" ; "Carmel" ; "David" ; "bc6b9b43053e20f5979dd2482bc67d1c6082a740" ; "David Carmel" . ; a ; "David H. Reiley" ; "Reiley" ; "David" ; ; "2dfd8e012ec6e6f7bd90ebe7e84a48e563501fba" ; "David H. Reiley" . ; a ; "David Hutchful" ; "Hutchful" ; "David" ; ; "8e485017f7813020719c3dde754bd6953dd8de8b" ; "David Hutchful" . ; a ; "David L. Johnson" ; "Johnson" ; "David" ; ; "eaee93a474053efdbee80208d051ec500661fc81" ; "David L. Johnson" . ; a ; "Davide Canali" ; "Canali" ; "Davide" ; ; "5cb235d1823fe43b66dccc9f68779bae71c6a44f" ; "Davide Canali" . ; a ; "Dawei Yin" ; "Yin" ; "Dawei" ; ; "a48c810c5e9ec14a0aad74faa87f0de08a49be1a" ; "Dawei Yin" . ; a ; "Decong Li" ; "Li" ; "Decong" ; ; "3ae0ef4c0fe7b331e13302511e27932c5c338cd7" ; "Decong Li" . ; a ; "Deepa Arun Paranjpe" ; ; "Deepa Arun Paranjpe" . ; a ; "Demetris Antoniades" ; "Antoniades" ; "Demetris" ; ; "6d8f5ec9b07b5a3f741f69c17f0648ad116b77d1" ; "Demetris Antoniades" . ; a ; "Denilson Barbosa" ; "Barbosa" ; "Denilson" ; ; "f234d62c563233c8be151f3811081edea15bae25" ; "Denilson Barbosa" . ; a ; "Denis Helic" ; "Helic" ; "Denis" ; ; "45cd8015b8e6d2403fbee769c75b0d75f26faab6" ; "Denis Helic" . ; a ; "Denis Turdakov" ; "Turdakov" ; "Denis" ; ; "ee2d3f53b449840585b497d35dc16cd46a7ecbeb" ; "Denis Turdakov" . ; a ; "Desmond Brand" ; "Brand" ; "Desmond" ; ; "5096bff7e59b03b486bc5d60e2367b97332337c1" ; "Desmond Brand" . ; a ; "Devshree Sane" ; "Sane" ; "Devshree" ; ; "4dc19bcb21f32d35afa596d46ea838a00c2ee303" ; "Devshree Sane" . ; a ; "Dhruv Mahajan" ; "Mahajan" ; "Dhruv" ; ; "b9e3e3da483c8cd333e1e6198b5e1c84db5c99e4" ; "Dhruv Mahajan" . ; a ; "Dinesh Garg" ; "Garg" ; "Dinesh" ; ; "03dec9d81aa927e5a200758ffcbfbac16aa93f1b" ; "Dinesh Garg" . ; a ; "Dipali Pal" ; "Pal" ; "Dipali" ; ; "424cb951f3af51991e267bb9abc54650e05d4a3e" ; "Dipali Pal" . ; a ; "Dipankar Das" ; "Das" ; "Dipankar" ; ; "b3062bb317c9c5eae4a5f42bdd9af542e0675d19" ; "Dipankar Das" . ; a ; "Divyakant Agrawal" ; "Agrawal" ; "Divyakant" ; ; "0b744d87fa866b3078862e3d4951dc9ed926d578" ; "Divyakant Agrawal" . ; a ; "Dmitry Lizorkin" ; "Lizorkin" ; "Dmitry" ; ; "2b1dd5dd6d6b12861616101d8ed932fb85ee8a4f" ; "Dmitry Lizorkin" . ; a ; "Dominic Damien" ; "Damien" ; "Dominic" ; ; "e7a7f9130b99f392c971eda5d0259fd95d8e35e6" ; "Dominic Damien" . ; a ; "Donato Malerba" ; "Malerba" ; "Donato" ; , ; "cbdab288c87d2e7a1a0f2a315ee423248778661a" ; "Donato Malerba" . ; a ; "Dong Xin" ; "Xin" ; "Dong" ; , ; "29fa73518186072e23bc0c9053a2b3142fb1cb69" ; "Dong Xin" . ; a ; "Dongyuan Lu" ; "Lu" ; "Dongyuan" ; ; "882af09cfe0e1f6a0b5e76209cf8dcfa15e8816a" ; "Dongyuan Lu" . ; a ; "Duncan J. Watts" ; "Watts" ; "Duncan" ; ; "f2b449530cf1a0f9095148537b11fb846a7d2842" ; "Duncan J. Watts" . ; a ; "Dyut Kumar Sil" ; "Sil" ; "Dyut Kumar" ; ; "bbb93867ca12c5b37307263f84a3b301f46c3ed0" ; "Dyut Kumar Sil" . ; ; a ; "Ed Cutrell" ; "Cutrell" ; "Ed" ; "7349f864bc26c2786849a9531abadc09528df20b" ; "Ed Cutrell" . ; a ; "Edo Liberty" ; "Liberty" ; "Edo" ; , ; "0d5e654f88540ea7941453c1affe13adeeafdba2" ; "Edo Liberty" . ; a ; "Edwin Lewis-Kelham" ; "Lewis-Kelham" ; "Edwin" ; ; "8e65a210ca43759111b320537c6835de415522f2" ; "Edwin Lewis-Kelham" . ; a ; "Elias Athanasopoulos" ; "Athanasopoulos" ; "Elias" ; ; "1bf30a4544ea9ca88b15aea96910aa1e9be87cc1" ; "Elias Athanasopoulos" . ; a ; "Elisa Bertino" ; ; "Elisa Bertino" . ; a ; "Elizabeth M. Belding" ; "Belding" ; "Elizabeth" ; ; "c3beb0f5aa12419cc0fe9c430a1181e81c99810f" ; "Elizabeth M. Belding" . ; a ; "Emmanuel Pietriga" ; "Pietriga" ; "Emmanuel" ; ; "b934b1388d99ae4d817260ebf5f03bd3b06cdd31" ; "Emmanuel Pietriga" . ; a ; "Emre Velipasaoglu" ; "Velipasaoglu" ; "Emre" ; ; "30a3af2fa196814b919b6d6860397018e441b179" ; "Emre Velipasaoglu" . ; a ; "Eric P. Xing" ; ; "Eric P. Xing" . ; a ; "Erik Wilde" ; "Wilde" ; "Erik" ; ; "f8040909d29f6dfc2e5d337ba982f832606069ae" ; "Erik Wilde" . ; a ; "Etienne Barnard" ; "Barnard" ; "Etienne" ; ; "97e322daed41980185bc6d5f02f8d34a17c1ffbe" ; "Etienne Barnard" . ; a ; "Eugene Agichtein" ; "Agichtein" ; "Eugene" ; ; "fa8d8c52e68a6ddda7b71f2be7f3efd15b76cc51" ; "Eugene Agichtein" . ; a ; "Evangelos P. Markatos" ; "Markatos" ; "Evangelos" ; ; "b90c2c86371ee7a17595a74ba77dc0f30e445354" ; "Evangelos P. Markatos" . ; a ; "Evgeniy Gabrilovich" ; "Gabrilovich" ; "Evgeniy" ; , ; "476698def3d51a8e02743c0433d5a4721e0f5644" ; "Evgeniy Gabrilovich" . ; a ; "Fabian M. Suchanek" ; "Suchanek" ; "Fabian" ; ; "44dff4aaf356421e238b2cf9f12e0d2255e89e65" ; "Fabian M. Suchanek" . ; a ; "Fabio Fumarola" ; "Fumarola" ; "Fabio" ; , ; "1219f3def8859c1e033e039cf5774b5ff3525b57" ; "Fabio Fumarola" . ; a ; "Fabrizio Silvestri" ; "Silvestri" ; "Fabrizio" ; , ; "62f5c8859abbce1f7f376c625d84a75816592792" ; "Fabrizio Silvestri" . ; a ; "Fang Yu" ; "Yu" ; "Fang" ; ; "e93e2b0af6954224935b38f9870987a15d0f848f" ; "Fang Yu" . ; a ; "Farzin Maghoul" ; "Maghoul" ; "Farzin" ; ; "1e49601b22f7c86456edc03b0a911ebf7a047f3e" ; "Farzin Maghoul" . ; a ; "Feifei Li" ; "Li" ; "Feifei" ; ; "bb42c775336dc5b6eda6591f3b126fb54b4c2a94" ; "Feifei Li" . ; a ; "Feng Zhou" ; "Zhou" ; "Feng" ; ; "eef589008ff2c400d8d6fb67c0cac1b0c6d7aa31" ; "Feng Zhou" . ; a ; "Fernando Diaz" ; "Diaz" ; "Fernando" ; ; "f39b729562aa898619f42453a2a0c9c8b517cff6" ; "Fernando Diaz" . ; a ; "Filippo Menczer" ; "Menczer" ; "Filippo" ; ; "08742d471664c6d04921dd413557aef59f46b6d9" ; "Filippo Menczer" . ; a ; "Florent Batard" ; "Batard" ; "Florent" ; ; "6517328fd87546045aa3ffa42a4ff7f6794e173a" ; "Florent Batard" . ; a ; "Francesco Bonchi" ; "Bonchi" ; "Francesco" ; ; "566a04b3bdac8e385705de7060ac11555b03a08c" ; "Francesco Bonchi" . ; a ; "Franco Maria Nardini" ; "Nardini" ; "Franco Maria" ; ; "158de4b3eb561c75b395bcec35db9c7ac94c2a21" ; "Franco Maria Nardini" . ; a ; "Frederick Maier" ; "Maier" ; "Frederick" ; ; "baf93810f2b0f88374a17e359852a85d983bb124" ; "Frederick Maier" . ; a ; "Gabriele Capannini" ; "Capannini" ; "Gabriele" ; ; "3276eb43d09242174a24a24904c9424ff1e7dfe5" ; "Gabriele Capannini" . ; a ; "Gal Lavee" ; "Lavee" ; "Gal" ; ; "62718a5ec91c3ac07835f6a1007cfaf827af0182" ; "Gal Lavee" . ; a ; "Ganesh Ramakrishnan" ; "Ramakrishnan" ; "Ganesh" ; ; "7277bb24a0d8c74e17f6da03887decd3ea5719d1" ; "Ganesh Ramakrishnan" . ; a ; "Gang Wang" ; "Wang" ; "Gang" ; , ; "3c83398366e30f0e8ab3308e7c37bb46f0976631" ; "Gang Wang" . ; a ; "Gang Wu" ; "Wu" ; "Gang" ; ; "ea8990114dce0b232f68bfe2549786c13b823257" ; "Gang Wu" . ; a ; "Gautam Korlam" ; "Korlam" ; "Gautam" ; ; "436a53ec58ecb055050ebbaa859021ace7103bc2" ; "Gautam Korlam" . ; a ; "Gehard Weikum" ; "Weikum" ; "Gehard" ; ; "d796b75d4c7fb79818474850ab456205f3180c4e" ; "Gehard Weikum" . ; a ; "Gennady Legostaev" ; "Legostaev" ; "Gennady" ; ; "bc0810a4961bb7af1b6433dcd199df77a5ace99d" ; "Gennady Legostaev" . ; a ; "Georg Gottlob" ; "Gottlob" ; "Georg" ; ; "14b8c2167fa728217c54d4a0c4d5d41fad0ea209" ; "Georg Gottlob" . ; a ; "Georgios Kontaxis" ; "Kontaxis" ; "Georgios" ; ; "6c4abf1be196aa56eeed7a716fe60cadae0cf314" ; "Georgios Kontaxis" . ; a ; "Gerard de Melo" ; "de Melo" ; "Gerard" ; ; "ec90b419df56801b984be77bc1d0e42f0d9a4e50" ; "Gerard de Melo" . ; a ; "Gerhard Weikum" ; "Weikum" ; "Gerhard" ; , , , ; "0d1c923dc66620f60ae698802880bd9675e69fd7", "d796b75d4c7fb79818474850ab456205f3180c4e" ; "Gerhard Weikum" . ; a ; "Gertjan van Stam" ; "van Stam" ; "Gertjan" ; ; "0d2ada7ebbac18746566d86f8b71cb60de35ef3e" ; "Gertjan van Stam" . ; a ; "Ghassan O. Karame" ; "Karame" ; "Ghassan" ; ; "984d985916800c6b5719d57e95a8408dc4e4895e" ; "Ghassan O. Karame" . ; a ; "Gholamreza Haffari" ; "Haffari" ; "Gholamreza" ; ; "a6bff13d1a735a4423ae4e1a0a113f4c78fd0eef" ; "Gholamreza Haffari" . ; a ; "Giovanni Grasso" ; "Grasso" ; "Giovanni" ; ; "c8167714b7f467a2365f953f7e683b76102fd4b3" ; "Giovanni Grasso" . ; a ; "Giovanni Vigna" ; "Vigna" ; "Giovanni" ; ; "271ba78e0c2b3cc59f6881afbcb025e0c132cabe" ; "Giovanni Vigna" . ; a ; "Gong Cheng" ; "Cheng" ; "Gong" ; ; "c2e6f4aca45ea8f27a70cd7c921e1d02f8e7700a" ; "Gong Cheng" . ; a ; "Gregory Lewis" ; "Lewis" ; "Gregory" ; ; "511dd98b6f368131ba566de622e3de8bb2ea5660" ; "Gregory Lewis" . ; a ; "Gu Xu" ; "Xu" ; "Gu" ; ; "0e472a92af7b0b4f9cb77d5cb48398a4c78eb906" ; "Gu Xu" . ; a ; "Gui-Rong Xue" ; "Xue" ; "Gui-Rong" ; ; "743754634937b601cb503d84133e4519d0705b6f" ; "Gui-Rong Xue" . ; a ; "Guichun Hua" ; "Hua" ; "Guichun" ; ; "82e7b5209656374e585b041e0aa7ef38b3395dfb" ; "Guichun Hua" . ; a ; "Guo-Jun Qi" ; "Qi" ; "Guo-Jun" ; ; "adfae9589b9f4bcdcf7e0a79da855bcf64314266" ; "Guo-Jun Qi" . ; a ; "Haizhou Fu" ; "Fu" ; "Haizhou" ; ; "e33923f1393f5fefb5a5c18ba6d1d04989b581c9" ; "Haizhou Fu" . ; a ; "Hamid Nazerzadeh" ; "Nazerzadeh" ; "Hamid" ; ; "9e0a1759948b5cea63682ef54268664bca59f84d" ; "Hamid Nazerzadeh" . ; a ; "Hanan Samet" ; "Samet" ; "Hanan" ; ; "3a9bc435a246c0f55b2e2065f46bffbc06cb61d8" ; "Hanan Samet" . ; a ; "Hang Li" ; "Li" ; "Hang" ; ; "3c8536c21023b70fbb992845fb340383c4753238" ; "Hang Li" . ; a ; "Hanghang Tong" ; "Tong" ; "Hanghang" ; ; "7716d0eb9ad9a179ea5f913c9301bbd47a806d64" ; "Hanghang Tong" . ; a ; "Hanqiang Cheng" ; "Cheng" ; "Hanqiang" ; ; "eb1e61690120692f08c7f9ccc5bca6d0e354458a" ; "Hanqiang Cheng" . ; a ; "Hans-Arno Jacobsen" ; "Jacobsen" ; "Hans-Arno" ; ; "98e739d01a1b1de271ceabfc03f5d5642c9885c5" ; "Hans-Arno Jacobsen" . ; a ; "Harry Chang" ; "Chang" ; "Harry" ; ; "d7b49f5fcb85b924c62146b50a7984ed3f1470db" ; "Harry Chang" . ; a ; "Hector Garcià-Molina" ; "Garcia-Molina" ; "Hector" ; ; "95b5cb277ce945e78748d67105d4dd5520eecb15" ; "Hector Garcià-Molina" . ; a ; "Hemant Kumar Mehta" ; "Mehta" ; "Hemant" ; ; "bc1b305083da0f998a1936d0c5defc7140a27db3" ; "Hemant Kumar Mehta" . ; a ; "Hideaki Takeda" ; "Takeda" ; "Hideaki" ; ; "85be230d494a03e4f3e994bbf053d4c7c74c0890" ; "Hideaki Takeda" . ; a ; "Hidetoshi Kawakubo" ; "Kawakubo" ; "Hidetoshi" ; ; "8aa0e2859ffb054b4c82fd01bdfc2016fedac74f" ; "Hidetoshi Kawakubo" . ; a ; "Himabindu Lakkaraju" ; "Lakkaraju" ; "Himabindu" ; ; "19afedd5fee240ebdc93c50e85ad3979c1a1b6cf" ; "Himabindu Lakkaraju" . ; a ; "Hoda Heidari" ; "Heidari" ; "Hoda" ; ; "c8e0f3e840338a7ada4903f6aa5cfffb334765c5" ; "Hoda Heidari" . ; a ; "Hoda Sepehri Rad" ; "Sepehri Rad" ; "Hoda" ; ; "3ef47fe56ce18c49da23a755b930a40c30acef7f" ; "Hoda Sepehri Rad" . ; a ; "Hong-Yuan Mark Liao" ; "Liao" ; "Hong-Yuan Mark" ; ; "a23452c53a3ce2d826867b60a1ba213cb015dfef" ; "Hong-Yuan Mark Liao" . ; a ; "Hongyan Liu" ; "Liu" ; "Hongyan" ; ; "57b280f234552586aa0580e5035187de1f945dc6" ; "Hongyan Liu" . ; a ; "Hongyuan Zha" ; "Zha" ; "Hongyuan" ; , ; "1a49742c553fee6583114364569e5843fe40e23b" ; "Hongyuan Zha" . ; a ; "Hossein Vahabi" ; "Vahabi" ; "Hossein" ; ; "a213857ca6ea8c67f29a3f0a011524114948c5b4" ; "Hossein Vahabi" . ; a ; "Hua-Wei Shen" ; "Shen" ; "Hua-Wei" ; ; "75dc2d1d831452e7f9020fa312c196b232a5e47f" ; "Hua-Wei Shen" . ; a ; "Huayu Wu" ; "Wu" ; "Huayu" ; ; "071ab2824e6ad8dae1d1602508866e05c528cc95" ; "Huayu Wu" . ; a ; "Huizhong Duan" ; "Duan" ; "Huizhong" ; ; "ef2c84a3c272398cda5fa8420ee89fd4853f2bbf" ; "Huizhong Duan" . ; a ; "Hyunyoung Kil" ; "Kil" ; "Hyunyoung" ; ; "06a1117d0e2793eccfd163be464b6c710f06f3ff" ; "Hyunyoung Kil" . ; a ; "Iasonas Polakis" ; "Polakis" ; "Iasonas" ; ; "2c348e21c86a5316b555227f3f4da31da20c0768" ; "Iasonas Polakis" . ; a ; "Idan Szpektor" ; "Szpektor" ; "Idan" ; ; "81db637981d4b46c1be634c8664b678c53746624" ; "Idan Szpektor" . ; ; a ; "Ido Guy" ; "Guy" ; "Ido" ; "4df311584ee5e6cdb524776ee7dd6f1dd46ae977" ; "Ido Guy" . ; a ; "Ilaria Liccardi" ; "Liccardi" ; "Ilaria" ; ; "78ba6ee4156d06c96ec475213000416480848828" ; "Ilaria Liccardi" . ; a ; "Ingmar Weber" ; "Weber" ; "Ingmar" ; ; "d579efb41d59af842251298d0ddb7adae1a782d5" ; "Ingmar Weber" . ; a ; "Ismail Sengor Altingovde" ; "Altingovde" ; "Ismail" ; ; "27a1d886fe79c9df59487b7eb1e8e70253fef619" ; "Ismail Sengor Altingovde" . ; a ; "Jack W. Stokes" ; "Stokes" ; "Jack" ; ; "eff5f260de57ff2a81f8f96cd4fcddc981a4b9f2" ; "Jack W. Stokes" . ; a ; "Jackson Tan Teck Yong" ; "Tan Teck Yong" ; "Jackson" ; ; "207ad36555d37fa4d189a063340e2567ffa4d8af" ; "Jackson Tan Teck Yong" . ; a ; "Jacob Eisenstein" ; "Eisenstein" ; "Jacob" ; ; "4692102af488c78f58a2336856d5c9ee065dfbd3" ; "Jacob Eisenstein" . ; a ; "Jacob Ratkiewicz" ; "Ratkiewicz" ; "Jacob" ; ; "0c836cc42fa9ad8844b30efee6bfef4e5b5282e2" ; "Jacob Ratkiewicz" . ; ; a ; "Jacopo Urbani" ; "Urbani" ; "Jacopo" ; "90ad63bcae75f99907827c39b8166d0637791055" ; "Jacopo Urbani" . ; a ; "Jae-Hong Eom" ; "Eom" ; "Jae-Hong" ; ; "e969ec8ec1502b9d06d6ac27bde69cd9209a1368" ; "Jae-Hong Eom" . ; a ; "Jaideep Srivastava" ; "Srivastava" ; "Jaideep" ; ; "2835fddf95c5b3fd1d3e97479de9df73040e3204" ; "Jaideep Srivastava" . ; a ; "Jaime Teevan" ; "Teevan" ; "Jaime" ; ; "69688525a955dcacc9f8f92ad152371453332293" ; "Jaime Teevan" . ; a ; "Jaimie Kwon" ; "Kwon" ; "Jaimie" ; ; "4271f8f09dc8f98db03664b40f62aee2912ef923" ; "Jaimie Kwon" . ; a ; "Jake M. Hofman" ; "Hofman" ; "Jake" ; ; "1b0a0a276350eb8b6340fa7733c5942b77658363" ; "Jake M. Hofman" . ; a ; "Jangwon Seo" ; "Seo" ; "Jangwon" ; ; "189c7e1e9c8f1a4ccdcd786890e1e493bd8acb12" ; "Jangwon Seo" . ; a ; "Jay Chen" ; "Chen" ; "Jay" ; , ; "1fa78a9f3ecdb4e01b75cb4eb73153d1b375b76d" ; "Jay Chen" . ; a ; "Jayavel Shanmugasundaram" ; "Shanmugasundaram" ; "Jayavel" ; ; "aaf5315a02ff1c7266eb53a1edfecbafcc096ece" ; "Jayavel Shanmugasundaram" . ; a ; "Jeff Pasternack" ; "Pasternack" ; "Jeff" ; ; "63bef1176f78fa3702dfada77e1d580503fe7251" ; "Jeff Pasternack" . ; a ; "Jennifer Chayes" ; "Chayes" ; "Jennifer" ; ; "5c27c3ca55f7d48e7acc78b8f95d5ab8df4ca53d" ; "Jennifer Chayes" . ; a ; "Jennifer Paykin" ; "Paykin" ; "Jennifer" ; ; "4ee948a5a5b09004a86d060eb289fe7d40b7b11e" ; "Jennifer Paykin" . ; a ; "Jeonghe Yi" ; "Yi" ; "Jeonghe" ; ; "1f06f440b3043194bdd403a12f4986f0b5ff5b9c" ; "Jeonghe Yi" . ; a ; "Ji-Soo Kim" ; "Kim" ; "Ji-Soo" ; ; "1f16d15de72b2e91f4f5e398f88ffb6051b3c0b2" ; "Ji-Soo Kim" . ; a ; "Ji Wang" ; "Wang" ; "Ji" ; ; "7e439055a43f7cdb7c462479ea2bfafa36e25132" ; "Ji Wang" . ; a ; "Jiafeng Guo" ; "Guo" ; "Jiafeng" ; ; "6ffe533f9d5539dfcf4b8a6b0cc4ee0cb2f7ffc4" ; "Jiafeng Guo" . ; a ; "Jianchang Mao" ; "Mao" ; "Jianchang" ; ; "a02a0587c2771f8725408141c06610086ee283e3" ; "Jianchang Mao" . ; a ; "Jianfeng Chen" ; "Chen" ; "Jianfeng" ; ; "ba34b572df03022e3c23ffa574e4b087c2995063" ; "Jianfeng Chen" . ; a ; "Jianping Fan" ; "Fan" ; "Jianping" ; ; "09751530c126332480dcd79be9a562413bf82ba3" ; "Jianping Fan" . ; a ; "Jianxing Yu" ; "Yu" ; "Jianxing" ; ; "0d438e87f1d253e57cf1e376d56ce42d12d22cc1" ; "Jianxing Yu" . ; a ; "Jianxun Dang" ; "Dang" ; "Jianxun" ; ; "1d4d8735249ea02a44e23751abeb544540c3cecb" ; "Jianxun Dang" . ; a ; "Jianyong Wang" ; "Wang" ; "Jianyong" ; ; "40ea5afa0e79b88c0ef201584cad8f0e57609adc" ; "Jianyong Wang" . ; a ; "Jianzhang He" ; "He" ; "Jianzhang" ; ; "893049c3c99d6731e0e78355f64bc70c1b7c606f" ; "Jianzhang He" . ; a ; "Jiawei Han" ; "Han" ; "Jiawei" ; , , , ; "1be69557e616abc3cd725b49c135a6648fb55429", "86661c92f9e9bdcdac48c0d26997ba8ac74cda6e" ; "Jiawei Han" . ; a ; "Jing Li" ; "Li" ; "Jing" ; ; "4f3c4324a6c1889623018365b4c9458fe647efa1" ; "Jing Li" . ; a ; "Jinghua Groppe" ; "Groppe" ; "Jinghua" ; ; "7b304733c94ccab7df2cb94424cd0d6f665424dc" ; "Jinghua Groppe" . ; a ; "Jintao Tang" ; "Tang" ; "Jintao" ; ; "d9c694e9cadb465faec3ea613bc5a567cc6dae20" ; "Jintao Tang" . ; a ; "Jinye Peng" ; "Peng" ; "Jinye" ; ; "7670a514d2e77fe126347d65cd348ae404d4e195" ; "Jinye Peng" . ; a ; "Jitendra Ajmera" ; "Ajmera" ; "Jitendra" ; ; "e2028a579c1ca739dc85722b65531f1b150176c9" ; "Jitendra Ajmera" . ; a ; "Joel Barajas" ; "Barajas" ; "Joel" ; ; "af32e7bd80077d5aa475bb81604e36aa9b23b309" ; "Joel Barajas" . ; a ; "Johannes Hoffart" ; "Hoffart" ; "Johannes" ; ; "271baf3015044bc8aa4783cc9ad472b6cb17bf4a" ; "Johannes Hoffart" . ; a ; "John E. Hopcroft" ; "Hopcroft" ; "John" ; ; "cf59563c68cb89f8a5bfba37d51dff69f2ebe73f" ; "John E. Hopcroft" . ; a ; "John P. John" ; "John" ; "John" ; ; "8e55f9bd6c00dce9d3d6dd7cc76e529251549e78" ; "John P. John" . ; a ; "Jon Crowcroft" ; "Crowcroft" ; "Jon" ; ; "90c3e08ef39b14adafc657335a0da4cd06c7b76c" ; "Jon Crowcroft" . ; a ; "Jon Kleinberg" ; "Kleinberg" ; "Jon" ; , ; "605e9d7ba76613f599834b81a8f62eabcc4771d9" ; "Jon Kleinberg" . ; a ; "Jonathan Ledlie" ; "Ledlie" ; "Jonathan" ; ; "291dd2d06d3c0fb8ff0aa30623f8f3a8b6bd9229" ; "Jonathan Ledlie" . ; a ; "Jose San Pedro" ; "San Pedro" ; "Jose" ; ; "6d280674f32744071c471c22eeac13dfdc0f38b3" ; "Jose San Pedro" . ; a ; "Joyojeet Pal" ; "Pal" ; "Joyojeet" ; ; "80497cb5137c617060ddab705fab56f6f990a38e" ; "Joyojeet Pal" . ; a ; "Jun Xu" ; "Xu" ; "Jun" ; ; "0831b4386ca33f5de71e6fe67262a29b36a7987a" ; "Jun Xu" . ; a ; "Jun Yan" ; "Yan" ; "Jun" ; ; "fc8747ef4abbf6919885cb7d1a351bffe5b210bf" ; "Jun Yan" . ; a ; "Junghoo Cho" ; "Cho" ; "Junghoo" ; ; "7b5c7f76a25ad3d8894f30193453ecb59117699f" ; "Junghoo Cho" . ; a ; "Junhui Wang" ; "Wang" ; "Junhui" ; ; "83a960e244e9ecd6d2de165e174ea260ce7f8689" ; "Junhui Wang" . ; a ; "Junjie Zhang" ; "Zhang" ; "Junjie" ; ; "87f8d69e6f39ac9f569f4cb3a698f79ddd9afb06" ; "Junjie Zhang" . ; ; a ; "Junlan Feng" ; "Feng" ; "Junlan" ; , ; "b2a61d341b201f73be62542ca252bb374138f9ee" ; "Junlan Feng" . , ; ; a ; "Jure Leskovec" ; "Leskovec" ; "Jure" ; ; "7b59e7aa9b583a1df1c39b73cbeed354d11fc270" ; "Jure Leskovec" . ; a ; "Justin M. Rao" ; "Rao" ; "Justin" ; ; "ce8858ef9b5d7d76f76ad25689b4872ca49c9c6b" ; "Justin M. Rao" . ; a ; "K. Parthasarathy" ; "Parthasarathy" ; "K" ; ; "d49c847f49f9789b6f0184593ca9dfaca6070dd0" ; "K. Parthasarathy" . ; a ; "Kai Li" ; "Li" ; "Kai" ; ; "9470503f0a3c030e07d6bb1060208f0097a619e7" ; "Kai Li" . ; a ; "Kalika Bali" ; "Bali" ; "Kalika" ; ; "e79f590c7a056d31aface109cd22789975a77f6d" ; "Kalika Bali" . ; a ; "Kamesh Munagala" ; "Munagala" ; "Kamesh" ; ; "02ec6e056283b97f3cd7b492cef1a14e813faa17" ; "Kamesh Munagala" . ; a ; "Kanika Gupta" ; "Gupta" ; "Kanika" ; ; "7a132db6f96239d411ff0a7ac6c1235ad81dd828" ; "Kanika Gupta" . ; a ; "Karima Boudaoud" ; "Boudaoud" ; "Karima" ; ; "df02e5a7747ea2884230dac4f7fdf686754190a0" ; "Karima Boudaoud" . ; a ; "Katsuhiko Ishiguro" ; "Ishiguro" ; "Katsuhiko" ; ; "4e5672fc0e6a6f8f7e309eaf3fff4633c2242a0e" ; "Katsuhiko Ishiguro" . ; a ; "Katsuji Bessho" ; "Bessho" ; "Katsuji" ; ; "e5744dde98a36d7d5ecbb5d9bda269273c36c496" ; "Katsuji Bessho" . ; a ; "Kaushik Chakrabarti" ; "Chakrabarti" ; "Kaushik" ; ; "5f5db86744f2e62eb5c234fcaa6951b633c40009" ; "Kaushik Chakrabarti" . ; a ; "Kaushik Nath" ; "Nath" ; "Kaushik" ; ; "08f084ff1a11f8154a28aa0e5182738738dcc1a9" ; "Kaushik Nath" . ; a ; "Kavitha Srinivas" ; "Srinivas" ; "Kavitha" ; ; "499f1fd7c4a228ed8b08d966bb7d51467dafa81a" ; "Kavitha Srinivas" . ; a ; "Ke Zhou" ; "Zhou" ; "Ke" ; ; "ef156d0727a4be02e1e7754f0909efbdfa420902" ; "Ke Zhou" . ; a ; "Keiji Yanai" ; "Yanai" ; "Keiji" ; ; "3a696fb26365d2f700bb31198af43978ab29701c" ; "Keiji Yanai" . ; a ; "Kemafor Anyanwu" ; "Anyanwu" ; "Kemafor" ; ; "03d92f3b00bef400861a3e3a8adb8ee7bfeebffb" ; "Kemafor Anyanwu" . ; a ; "Kevin McCarthy" ; "McCarthy" ; "Kevin" ; ; "5fefeb0799fcb94bc98fd794aeed2fc5f8065918" ; "Kevin McCarthy" . ; a ; "Kilian Q. Weinberger" ; "Weinberger" ; "Kilian" ; ; "a94d8d3be0ac0c3477274a13f7c77f64c1fd30ad" ; "Kilian Q. Weinberger" . ; a ; "Kira Radinsky" ; "Radinsky" ; "Kira" ; ; "31f1190262bca0a792b3560c870ff307d8628363" ; "Kira Radinsky" . ; a ; "Klaus Berberich" ; "Berberich" ; "Klaus" ; ; "89a6f531d3f67cbae3b725e099fed5d5adc048e8" ; "Klaus Berberich" . ; a ; "Kotaro Nakayama" ; "Nakayama" ; "Kotaro" ; ; "757399d032230e03517c4ab5c3171b15d9a9f410" ; "Kotaro Nakayama" . ; a ; "Krishnaram Kenthapadi" ; "Kenthapadi" ; "Krishnaram" ; ; "a358c0ac983a730281879c8eddcf2b5d5d5b1676" ; "Krishnaram Kenthapadi" . ; a ; "Kristina Lerman" ; "Lerman" ; "Kristina" ; ; "bf6514cb1fd572a96599becb1bad1b978aad3ada" ; "Kristina Lerman" . ; a ; "Krithi Ramamritham" ; ; "Krithi Ramamritham" . ; a ; "Krysta M. Svore" ; "Svore" ; "Krysta" ; ; "d8be2b489c7d29d9793f93870bd61b8c5ea48523" ; "Krysta M. Svore" . ; a ; "Kuansan Wang" ; "Wang" ; "Kuansan" ; ; "59eac287e821781d1480bed745ab493b73bd24b8" ; "Kuansan Wang" . ; a ; "Kumaresh Pattabiraman" ; "Pattabiraman" ; "Kumaresh" ; ; "4061b1dcdc2cb6c96eb15b1dea5885729f3b83bf" ; "Kumaresh Pattabiraman" . ; a ; "Kunal Agrawal" ; "Agrawal" ; "Kunal" ; ; "9a1ce2c4f3faed88ceee02d8420a5da7fca0fd52" ; "Kunal Agrawal" . ; a ; "Kundan Srivastava" ; "Srivastava" ; "Kundan" ; ; "48c86860d188cc1a3048de1b738471e21c7ec203" ; "Kundan Srivastava" . ; a ; "Kushal Dave" ; ; "Kushal Dave" . ; a ; "L. Elisa Celis" ; "Celis" ; "L. Elisa" ; ; "5056cc7287491286622486be12f041f27489eb72" ; "L. Elisa Celis" . ; a ; "Laks V. S. Lakshmanan" ; "Lakshmanan" ; "Laks" ; ; "af52b913d98275554a4aaf4e6804d924f9e5a3bc" ; "Laks V. S. Lakshmanan" . ; a ; "Lakshminarayanan Subramanian" ; "Subramanian" ; "Lakshminarayanan" ; , , ; "acc09d755b0ae65c67225de6d74362e2fc77a68e" ; "Lakshminarayanan Subramanian" . ; a ; "Larry S. Davis" ; "Davis" ; "Larry" ; ; "acfbad6f197713cff20d9997373a5c4b8f55df52" ; "Larry S. Davis" . ; ; a ; "Lars Backstrom" ; "Backstrom" ; "Lars" ; ; "8da7b2684996b3a12ece14532ae3481c26433303", "b1bd8072132e56348b57ac5db28d0cd2d0a029ff" ; "Lars Backstrom" . ; a ; "Lei Ji" ; "Ji" ; "Lei" ; ; "21f69034094b52ceba03d0937820edab718dc127" ; "Lei Ji" . ; a ; "Lei Zhang" ; "Zhang" ; "Lei" ; ; "1662c8094e1c642e15a4976c170f6b681db7e8da" ; "Lei Zhang" . ; a ; "Liang Kong" ; "Kong" ; "Liang" ; ; "0e7f858ecd1c512adf0773c4b1b648f368d86c92" ; "Liang Kong" . ; a ; "Liang Xu" ; "Xu" ; "Liang" ; ; "40a300a364c7f11f14f07ecaee62ca1aaff7020c" ; "Liang Xu" . ; a ; "Liangda Li" ; "Li" ; "Liangda" ; ; "8f75d90e9d4cfd8fcfc68cd9e76c2f9c19826cc6" ; "Liangda Li" . ; a ; "Liangjie Hong" ; "Hong" ; "Liangjie" ; , ; "4495abcde8915add1b5591e469d6bd11ea92e353", "f9c6592efde729cccfd59c2f70c91d8425ba30ea" ; "Liangjie Hong" . ; a ; "Liangliang Cao" ; "Cao" ; "Liangliang" ; ; "5d5abad675909f452b8173b96100f1f1466efc4f" ; "Liangliang Cao" . ; a ; "Liran Katzir" ; "Katzir" ; "Liran" ; ; "ae82720a6fd906f3bb27937cbc3a8d459182fdaa" ; "Liran Katzir" . ; a ; "Liviu Iftode" ; "Iftode" ; "Liviu" ; ; "9af4692dfe33028654a524c85f68ab87acff4587" ; "Liviu Iftode" . ; a ; "Liyun Ru" ; "Ru" ; "Liyun" ; ; "64f8dcb2de978702ac5004c3c9d6969b2c058b26" ; "Liyun Ru" . ; a ; "Lluis Garcia Pueyo" ; "Pueyo" ; "Lluis" ; ; "b44479bfee04401fd00a8005a2169c5a3909f87e" ; "Lluis Garcia Pueyo" . ; a ; "Lorenzo Blanco" ; "Blanco" ; "Lorenzo" ; , ; "b2398cbabdeeb0d565f7db529252d7f6df1ca4b7" ; "Lorenzo Blanco" . ; a ; "Luciano Barbosa" ; "Barbosa" ; "Luciano" ; ; "8c50c94703dc845ba8854845354028dc30faa25d" ; "Luciano Barbosa" . ; a ; "Lydia B. Chilton" ; "Chilton" ; "Lydia" ; ; "a67807a06d2b90a3145b5337007e7a277fc7d6e6" ; "Lydia B. Chilton" . ; a ; "Maik Anderka" ; "Anderka" ; "Maik" ; ; "8a762a18d61e4686c2e3ec7d6f84fb8434bed33f" ; "Maik Anderka" . ; a ; "Maksims N. Volkovs" ; "Volkovs" ; "Maksims" ; ; "a1d3071cfc125263c749fafe96fd69ef3ba06c51" ; "Maksims N. Volkovs" . ; a ; "Mallik Tatipamula" ; "Tatipamula" ; "Mallik" ; ; "b3723e5eccd56ed2bb8a699cff16578b62f9da3b" ; "Mallik Tatipamula" . ; a ; "Malu Castellanos" ; "Castellanos" ; "Malu" ; , ; "b33dab4a3e3f4b6359de08bfa4b270c724049220" ; "Malu Castellanos" . ; a ; "Man-Kwan Shan" ; "Shan" ; "Man-Kwan" ; ; "e34ef824f6e21cf8d362c3846cb490564c8f1ef4" ; "Man-Kwan Shan" . ; a ; "Manas Pradhan" ; "Pradhan" ; "Manas" ; ; "57d1843e9dfb4f5b2b1fc976dcdcf35e54029816" ; "Manas Pradhan" . ; a ; "Mangesh Gupte" ; "Gupte" ; "Mangesh" ; ; "a4f15ea0c86e80c89c274b2f48829e4ceb88071a" ; "Mangesh Gupte" . ; a ; "Manik Varma" ; "Varma" ; "Manik" ; ; "3573fd89eb5f81008ae16e6267e6617d72f0ae88" ; "Manik Varma" . ; , ; a ; "Manish Gupta" ; "Gupta" ; "Manish" ; ; "619ed3b923d039915885fede2aa3acdb73cd391a", "6ab7e0cd6083cf56fe7462cb3b19e6843501f2ed" ; "Manish Gupta" . ; a ; "Manohar Chandwani" ; "Chandwani" ; "Manohar" ; ; "6f727dbea50e5503468817ef1b7186fced9b07cb" ; "Manohar Chandwani" . ; a ; "Mao Ye" ; "Ye" ; "Mao" ; ; "195c010cf975f6c81b79f2e1b8ef071f41020563" ; "Mao Ye" . ; a ; "Maoqiang Xie" ; "Xie" ; "Maoqiang" ; ; "e22dbc0bf10323b4555872f789887439dbc10bc1" ; "Maoqiang Xie" . ; a ; "Marc Spaniol" ; "Spaniol" ; "Marc" ; ; "c2be4656f34865fa24c0cbeb25fe05ae2cc1d1d4" ; "Marc Spaniol" . ; a ; "Marcel Waldvogel" ; "Waldvogel" ; "Marcel" ; ; "262fb12ee2a85e14aefee6684972e80d6e3de745" ; "Marcel Waldvogel" . , ; a ; "Marcelo Mendoza" ; "Mendoza" ; "Marcelo" ; ; "30fc04585dec07dea5a42a8e96c13fb8c591ba6d" ; "Marcelo Mendoza" . ; a ; "Marco Brambilla" ; "Brambilla" ; "Marco" ; ; "63b2277d10688932cad6a82d0c95f50b392c5005" ; "Marco Brambilla" . ; a ; "Marco Cova" ; "Cova" ; "Marco" ; ; "301a14eb2fc987e6017feb0ad5202320e149f0df" ; "Marco Cova" . ; a ; "Marco D. Adelfio" ; "Adelfio" ; "Marco" ; ; "280cd0ef74361f3fc11fd32f8a0bedc087f830e2" ; "Marco D. Adelfio" . , ; a ; "Marco Pennacchiotti" ; "Pennacchiotti" ; "Marco" ; , , ; "29f627bb2c0b2997e796b5b32fc53e172745c563" ; "Marco Pennacchiotti" . ; a ; "Marco Rosa" ; "Rosa" ; "Marco" ; , ; "e23a152acb8a5ba1704593da796ccac3760ae242" ; "Marco Rosa" . ; a ; "Marcus Fontoura" ; "Fontoura" ; "Marcus" ; ; "b7e04d91f762c904a817c9b163793b7988ef6dd0" ; "Marcus Fontoura" . ; a ; "Margaret Martonosi" ; "Martonosi" ; "Margaret" ; ; "2e7fcf9c845f469c1c754cf2862170be69cc0330" ; "Margaret Martonosi" . ; a ; "Maria Grineva" ; "Grineva" ; "Maria" ; ; "010fcce7eedd85a58cdcfe81cc80f13fae054f97" ; "Maria Grineva" . ; a ; "Marius Holtan" ; "Holtan" ; "Marius" ; ; "1173e669a1fad14690e08adfbf53de14c3b10934" ; "Marius Holtan" . ; ; a ; "Marius PaÅŸca" ; "Pasca" ; "Marius" ; "8c7dd89f739f78b0b8d5911d63f6cec7c657b7bd" ; "Marius PaÅŸca" . ; a ; "Mark Meiss" ; "Meiss" ; "Mark" ; ; "20fee5d9764bc1040d499b9d164819c2c8f01ad8" ; "Mark Meiss" . ; ; a ; "Marko Grobelnik" ; "Grobelnik" ; "Marko" ; "af6075d5ec0561f5ba682e65dd0c9460f5e0e889" ; "Marko Grobelnik" . ; a ; "Markus Krötzsch" ; "Krötzsch" ; "Markus" ; ; "ec5b03c4c2217d74fe561a2090baf15415f873cd" ; "Markus Krötzsch" . ; a ; "Markus M. Mobius" ; "Mobius" ; "Markus" ; ; "bd46e7eb20852c16d53565daa5c4545ecf8791eb" ; "Markus M. Mobius" . ; a ; "Markus Muhr" ; "Muhr" ; "Markus" ; ; "5aa5f9450c9c343123f5a6ca122c330f09bc66be" ; "Markus Muhr" . ; a ; "Markus Strohmaier" ; "Strohmaier" ; "Markus" ; ; "0c3e699e18373a1e3e145661ab50539446e45492" ; "Markus Strohmaier" . ; a ; "Martín Abadi" ; "Abadi" ; "MartÃŒn" ; ; "2abb7aa5ca1fafce9e22fc8860ce3a626b407821" ; "Martín Abadi" . ; a ; "Martin Ester" ; "Ester" ; "Martin" ; ; "972c5ea26c6e0a33ed0f51f5d92f864c5ef91141" ; "Martin Ester" . ; a ; "Martin Potthast" ; "Potthast" ; "Martin" ; ; "4850aa1b4266a82be34aab0cd969ad2a7f0f09cf" ; "Martin Potthast" . ; a ; "Mary Ellen Zurko" ; ; "Mary Ellen Zurko" . ; a ; "Maryam Karimzadehgan" ; "Karimzadehgan" ; "Maryam" ; ; "052757872e97d61549be12ef9a59654723e6bd6e" ; "Maryam Karimzadehgan" . ; a ; "Masahiro Hamasaki" ; "Hamasaki" ; "Masahiro" ; ; "6bb3a4b5d6049193b74f59afd0d3232948cee7ec" ; "Masahiro Hamasaki" . ; a ; "Masaru Kitsuregawa" ; "Kitsuregawa" ; "Masaru" ; ; "fff8b80841910d69d471daefd367b12d75050859" ; "Masaru Kitsuregawa" . ; a ; "Masashi Toyoda" ; "Toyoda" ; "Masashi" ; ; "5e1b0aa56b4b76ff0eaebf277097d5222c62802b" ; "Masashi Toyoda" . ; a ; "Massimo Santini" ; "Santini" ; "Massimo" ; ; "6a11a9f67b37d84eaf4ad242d31fb86372ae087a" ; "Massimo Santini" . ; ; a ; "Matt Cooper" ; "Cooper" ; "Matt" ; "003c6ba6a31599d7a65e31c365f7a78aa68eaaa5" ; "Matt Cooper" . ; a ; "Matthew Richardson" ; "Richardson" ; "Matthew" ; ; "872d64a9113c948201b606b8e0ccd73eec02b7e2" ; "Matthew Richardson" . ; a ; "Matthias Hagen" ; "Hagen" ; "Matthias" ; ; "433e69dec2f4682333208d18300a28cc5b40b2d6" ; "Matthias Hagen" . ; a ; "Mauro Passacantando" ; "Passacantando" ; "Mauro" ; ; "c90cd459c487057dfcfbe846c080c2fc00d8c047" ; "Mauro Passacantando" . ; a ; "Mauro Sozio" ; "Sozio" ; "Mauro" ; ; "9ccd7d676160c3b2d23d43029919238d99ec43e3" ; "Mauro Sozio" . ; a ; "Maxim Grinev" ; "Grinev" ; "Maxim" ; ; "04d0f9a7d443dcef2ee90c14cf3b5b906afb7bde" ; "Maxim Grinev" . ; a ; "Mayank Shrivastava" ; "Shrivastava" ; "Mayank" ; ; "ced37ddbbe43a2ed1f0d5a8e780a8ffd4bbde875" ; "Mayank Shrivastava" . ; ; a ; "Meena Nagarajan" ; "Nagarajan" ; "Meena" ; "ec4d359cf4cb5a161c3bf62850597ff1898752f2" ; "Meena Nagarajan" . ; a ; "Meichun Hsu" ; "Hsu" ; "Meichun" ; ; "38720b505b16ad0950c082de555b01ffbb896103" ; "Meichun Hsu" . ; a ; "Meng Wang" ; "Wang" ; "Meng" ; ; "d7c84813696ea8289e397e4965a3e31d8da14935" ; "Meng Wang" . ; a ; "Mengdong Yang" ; "Yang" ; "Mengdong" ; ; "0abd21bfe3737ba581e0b9484a45fd4971172c7e" ; "Mengdong Yang" . ; a ; "Michael Conover" ; "Conover" ; "Michael" ; ; "a7ab7caaaffc807fb0adc7c9cb4164aa561132da" ; "Michael Conover" . ; a ; "Michael D. Lieberman" ; "Lieberman" ; "Michael" ; ; "96c688531d6998346833da6062755830e692bbe4" ; "Michael D. Lieberman" . ; a ; "Michael Gamon" ; "Gamon" ; "Michael" ; ; "8da48203bad93015f6049c93f40450800a86d8ff" ; "Michael Gamon" . ; a ; "Michael Gertz" ; "Gertz" ; "Michael" ; ; "315dfb67c454f24bd84a7d684bcf97277c4c46cc" ; "Michael Gertz" . ; a ; "Michael Grabchak" ; "Grabchak" ; "Michael" ; ; "624210220011771a635b13157e51f5e577dcb293" ; "Michael Grabchak" . ; a ; "Michael J. Ward" ; "Ward" ; "Michael" ; ; "34e9798171352c924548072a5e4f29e9e9daf92b" ; "Michael J. Ward" . ; a ; "Michael J. Welch" ; "Welch" ; "Michael" ; ; "967389e86d1fffb0396c95c7507502c6a4c39786" ; "Michael J. Welch" . ; ; a ; "Michael Johnston" ; "Johnston" ; "Michael" ; "231c1c30258d7cc7d6f33a3d65b30bda9bb75f80" ; "Michael Johnston" . ; a ; "Michael Rabinovich" ; "Rabinovich" ; "Michael" ; ; "e47de30698140d9ae41a4c0c158846d5698dfd1f" ; "Michael Rabinovich" . ; a ; "Michael W. Macy" ; ; "Michael W. Macy" . ; a ; "Michel Riveill" ; "Riveill" ; "Michel" ; ; "2e7660a7ba74eb987670539e74843f8d1228bf9c" ; "Michel Riveill" . ; a ; "Mihir Shah" ; "Shah" ; "Mihir" ; ; "590d4837a3ec215b7f47bf6ecda441ec561bba7d" ; "Mihir Shah" . ; a ; "Mike Bennett" ; "Bennett" ; "Mike" ; ; "87e1ef26b9ae3082e2c3172489a9a5900fb646f9" ; "Mike Bennett" . ; a ; "Mikhil Masli" ; "Masli" ; "Mikhil" ; ; "27a7d1ab280d5056bc71746721ce555ac2b8505b" ; "Mikhil Masli" . , ; a ; "Min Wang" ; "Wang" ; "Min" ; , ; "ebe507d3d6f575a83a3f19e7b2457cf8054deac9" ; "Min Wang" . ; a ; "Min Ye" ; "Ye" ; "Min" ; ; "f5a35665a10858b63bb98b292d96d5dcbad4c1e6" ; "Min Ye" . ; a ; "Min Zhang" ; "Zhang" ; "Min" ; ; "20dd78c59087671ccc2b49f4b89bd70e220fbef1" ; "Min Zhang" . ; a ; "Mingyan Gao" ; "Gao" ; "Mingyan" ; ; "fe13cbe1af098a6ef451322f5584f580880b4f6d" ; "Mingyan Gao" . ; a ; "Minsuk Kahng" ; "Kahng" ; "Minsuk" ; ; "4396da9ccadcc5fccc6845f722067b4e1a964146" ; "Minsuk Kahng" . ; a ; "Mirco Musolesi" ; "Musolesi" ; "Mirco" ; ; "c5b05e6c108454d3f0715780bd48f45cb772bd6e" ; "Mirco Musolesi" . ; a ; "Mirit Shalem" ; "Shalem" ; "Mirit" ; ; "90b4b42000b395dc97b04bf2d63277b82534cc16" ; "Mirit Shalem" . ; a ; "Mirko Bronzi" ; "Bronzi" ; "Mirko" ; ; "85815d2f6bf0dd66867dc8c01550e3edae0cae17" ; "Mirko Bronzi" . ; a ; "Mitsuru Ishizuka" ; "Ishizuka" ; "Mitsuru" ; ; "3fdfc695ab878aa00da5c3740e00e6411187946b" ; "Mitsuru Ishizuka" . ; a ; "Mohamed Dekhil" ; "Dekhil" ; "Mohamed" ; ; "c05eed20aa2039db4b80e36fea6f09ea5294fcda" ; "Mohamed Dekhil" . ; a ; "Mohsen Jamali" ; "Jamali" ; "Mohsen" ; ; "b0e9ceaf59656182b864c84bfcb4a0fd3a5fc2a4" ; "Mohsen Jamali" . ; a ; "Monika Henzinger" ; "Henzinger" ; "Monika" ; ; "1d50fc340e38fa444674913455c731a9c4961f82" ; "Monika Henzinger" . ; a ; "Monojit Choudhury" ; "Choudhury" ; "Monojit" ; , ; "e751729c2426add24ff572cea7d5adea22912faa" ; "Monojit Choudhury" . ; a ; "Moses Charikar" ; ; "Moses Charikar" . ; a ; "Murat Kantarcioglu" ; "Kantarcioglu" ; "Murat" ; ; "36f5b37a96a008d7ffe0e2835a40eca087cf0168" ; "Murat Kantarcioglu" . ; a ; "Na Dai" ; "Dai" ; "Na" ; ; "033416d43f7d838cb7effad1c9425e1bc6595a37" ; "Na Dai" . ; a ; "Naama Kraus" ; "Kraus" ; "Naama" ; ; "55d87fc5617be8e4ddfec8bcbeda5e697b7f8e13" ; "Naama Kraus" . ; a ; "Narayan Bhamidipati" ; "Bhamidipati" ; "Narayan" ; ; "6d8c8f81f36c952cb5864c9dadab140cfa1819be" ; "Narayan Bhamidipati" . ; a ; "Narayanan Sadagopan" ; "Sadagopan" ; "Narayanan" ; ; "06d41f72810723318e2779a3d53a05a16055c043" ; "Narayanan Sadagopan" . ; a ; "Naren Chittar" ; "Chittar" ; "Naren" ; ; "35d80136522486e605bf04bcf6d3e3f26e02b978" ; "Naren Chittar" . ; a ; "Natalie Glance" ; "Glance" ; "Natalie" ; ; "0629a96f6165100b9215b2be6f56dcf61095fd10" ; "Natalie Glance" . ; a ; "Nazli Goharian" ; "Goharian" ; "Nazli" ; ; "0ceb991df8d106fb4d904275bf867f2f511b1cc1" ; "Nazli Goharian" . ; a ; "Nedim Lipka" ; "Lipka" ; "Nedim" ; ; "2b5761c87f3adc28055811df83b48c55fcebf6c8" ; "Nedim Lipka" . ; a ; "Neel Sundaresan" ; "Sundaresan" ; "Neel" ; ; "cfe1cbf748e58de9c21828aee66a44222964cf79" ; "Neel Sundaresan" . ; a ; "Nenad Stojanovic" ; "Stojanovic" ; "Nenad" ; ; "007d68928154197eca5f50ab1110dd282a812d85" ; "Nenad Stojanovic" . ; a ; "Nicolas Torzec" ; "Torzec" ; "Nicolas" ; ; "487fcea5999fcc317a72d06c1f259ba7d1f6272b" ; "Nicolas Torzec" . ; a ; "Nicoleta Preda" ; "Preda" ; "Nicoleta" ; ; "f2b3e928d3f77518ab7f758b2db743f67660d03d" ; "Nicoleta Preda" . ; a ; "Nikita Mishra" ; "Mishra" ; "Nikita" ; ; "238fcb82d3bd2cd6ed0c547aaa19e92ae491f43f" ; "Nikita Mishra" . ; a ; "Nilesh Dalvi" ; "Dalvi" ; "Nilesh" ; ; "5225f911757d1f5011a18e9fbeac547d9c488fbf" ; "Nilesh Dalvi" . ; a ; "Niloy Ganguly" ; "Ganguly" ; "Niloy" ; , , ; "76cef4afc5bb4a762645c06e0e6acf1bb0491a91" ; "Niloy Ganguly" . ; a ; "Ning Liu" ; "Liu" ; "Ning" ; ; "58490329702b5d9123b9d929f289fedf8f810bab" ; "Ning Liu" . ; a ; "Ning Zhou" ; "Zhou" ; "Ning" ; ; "7d43e02cfa85d967c5724709718a420b036adacf" ; "Ning Zhou" . ; a ; "Nish Parikh" ; "Parikh" ; "Nish" ; ; "feb229a07ef193392f21898a6e5df9b3bf9b2815" ; "Nish Parikh" . ; a ; "Nitendra Rajput" ; "Rajput" ; "Nitendra" ; ; "48e5731b52908e5d12793823f1cde2cc445792f8" ; "Nitendra Rajput" . ; a ; "Nitin Dua" ; "Dua" ; "Nitin" ; ; "562b4018509bbf929710eabd13cab279598e64c9" ; "Nitin Dua" . ; a ; "Nitin Jindal" ; "Jindal" ; "Nitin" ; ; "a3be0cf91373692d963bde985e8e614b4f59170f" ; "Nitin Jindal" . ; a ; "Norifumi Katafuchi" ; "Katafuchi" ; "Norifumi" ; ; "13973e95a86cbf8a3444bbb67efd0e14a78ab459" ; "Norifumi Katafuchi" . ; a ; "Norman Heino" ; "Heino" ; "Norman" ; ; "ea8289538eb8b4b342aa3ffe4a44371f5d98a36e" ; "Norman Heino" . ; a ; "Odysseas Papapetrou" ; "Papapetrou" ; "Odysseas" ; ; "b1d41696f7027a7f13b9e4fd8e3aefc5ddf1ca9c" ; "Odysseas Papapetrou" . ; a ; "Özgür Ulusoy" ; "Ulusoy" ; "Özgür" ; ; "b72200736875ebc75f7636d038c7d369691175c7" ; "Özgür Ulusoy" . ; a ; "Oktie Hassanzadeh" ; "Hassanzadeh" ; "Oktie" ; ; "febb869d3c43789c3a4ee77d5adf0b0d7c16afb3" ; "Oktie Hassanzadeh" . ; a ; "Oren Somekh" ; "Somekh" ; "Oren" ; , ; "47f6b0d492158398bb2821ade114e6b15d0021d8" ; "Oren Somekh" . ; a ; "Ovidiu Dan" ; "Dan" ; "Ovidiu" ; , , ; "6470b744ddf02160b850f46a953dea167af6cb34", "f582328c82882f973a163ada8a17729c3d026083" ; "Ovidiu Dan" . ; a ; "Owen Phelan" ; "Phelan" ; "Owen" ; ; "7d819b4eeccd892f249c11a68e0ad4b81a7aae81" ; "Owen Phelan" . ; a ; "P. Krishna Reddy" ; ; "P. Krishna Reddy" . ; a ; "P. Kumar Sreenivasa" ; ; "P. Kumar Sreenivasa" . ; a ; "P. Ravindra" ; ; "P. Ravindra" . ; a ; "Pan Du" ; "Du" ; "Pan" ; ; "5048dd8fa51e2203bcbb792aa3c3a696f79b36ba" ; "Pan Du" . ; ; a ; "Panagiotis G. Ipeirotis" ; "Ipeirotis" ; "Panagiotis" ; , ; "e46c9769cdfa8e5da1286256fdce2f45de19f24f" ; "Panagiotis G. Ipeirotis" . ; ; a ; "Panos Ipeirotis" ; "Ipeirotis" ; "Panos" ; "e46c9769cdfa8e5da1286256fdce2f45de19f24f" ; "Panos Ipeirotis" . ; a ; "Paolo Boldi" ; "Boldi" ; "Paolo" ; , ; "4d9da1f9fe7881e8f361e879df5e2a8248dd9454" ; "Paolo Boldi" . ; a ; "Paolo Merialdo" ; "Merialdo" ; "Paolo" ; ; "89b9761a1f37a464847f216a63c2576f06ec22df" ; "Paolo Merialdo" . ; a ; "Paolo Papotti" ; "Papotti" ; "Paolo" ; ; "194e816a0930f137df24a91abec749d51eef67b8" ; "Paolo Papotti" . ; a ; "Partha Pratim Talukdar" ; "Talukdar" ; "Partha" ; ; "43da3bbd8cf2d45917d7af0ff48235c43daa69be" ; "Partha Pratim Talukdar" . ; a ; "Pascal Hitzler" ; "Hitzler" ; "Pascal" ; ; "4154cef9a6c6dcc95c0445e9a5870cc536252259" ; "Pascal Hitzler" . ; a ; "Paul Dütting" ; "Dütting" ; "Paul" ; ; "23e0e661055536e688ba32c67060e9972163b309" ; "Paul Dütting" . ; a ; "Paul Fodor" ; "Fodor" ; "Paul" ; ; "05d1180af5838b97debb4418df1c07f91e1fd3d5" ; "Paul Fodor" . ; a ; "Paul Heymann" ; "Heymann" ; "Paul" ; ; "4b50413ec60a8e286b2dfe821647db84e570c550" ; "Paul Heymann" . ; a ; "Perla Ruiz" ; "Ruiz" ; "Perla" ; ; "d3da6d952cfa3b5dafe8fd69630bb44c610919a6" ; "Perla Ruiz" . ; a ; "Piero Fraternali" ; "Fraternali" ; "Piero" ; ; "3a741493f4b984826f573a69948b5861eadd6c1a" ; "Piero Fraternali" . ; a ; "Pinaki Sinha" ; "Sinha" ; "Pinaki" ; , ; "6245fcfac2683ae3dadbcf3de26adedbc1fe1053" ; "Pinaki Sinha" . ; a ; "Ping Luo" ; "Luo" ; "Ping" ; ; "8a015fb78bd2b3cd8fc17d5ef5caae7c268854f6" ; "Ping Luo" . ; a ; "Pinyan Lu" ; "Lu" ; "Pinyan" ; ; "d0d4383d3f06febed0a86023a3bc25960c67a010" ; "Pinyan Lu" . ; a ; "Pranam Kolari" ; "Kolari" ; "Pranam" ; ; "e42c549624de44eec914ec130763b373ebc48617" ; "Pranam Kolari" . ; ; a ; "Praveen K. Paritosh" ; "Paritosh" ; "Praveen" ; "c98bc1a884de158fd43001a84c9d6d5f164d1379" ; "Praveen K. Paritosh" . ; , ; a ; "Praveen Paritosh" ; "Paritosh" ; "Praveen" ; "c98bc1a884de158fd43001a84c9d6d5f164d1379" ; "Praveen Paritosh" . ; a ; "Praveen R. Rao" ; "Rao" ; "Praveen" ; ; "33b85ce4c64fbbcc9f11fe1f23ebb294b7ec9b64" ; "Praveen R. Rao" . ; a ; "Pravin Shankar" ; "Shankar" ; "Pravin" ; ; "b58b349b5f514a7584f5ff53aeb6c5be85f765d5" ; "Pravin Shankar" . ; a ; "Preston McAfee" ; "McAfee" ; "Preston" ; ; "6e326ae08312a498a254dcce187fbc8dc3ec4ec3" ; "Preston McAfee" . ; a ; "Prithviraj Sen" ; "Sen" ; "Prithviraj" ; ; "9bc6873ceec8123dcc4872df0757326ac4158867" ; "Prithviraj Sen" . ; a ; "Priyesh Kanungo" ; "Kanungo" ; "Priyesh" ; ; "3561ae296b683f30d404972181da07c461581a1f" ; "Priyesh Kanungo" . ; a ; "Pushkar Kane" ; "Kane" ; "Pushkar" ; ; "b41f9d24d72d69238271e0fc734f029f68bbbdc2" ; "Pushkar Kane" . ; a ; "Qiang Yang" ; "Yang" ; "Qiang" ; ; "3c1bef10c8234da0064ba61648bef15546f9d92a" ; "Qiang Yang" . ; a ; "Qin Lu" ; "Lu" ; "Qin" ; ; "9cf602240566cc4fbfe27a0577f8603bcd6394f8" ; "Qin Lu" . ; a ; "Qin Lv" ; "Lv" ; "Qin" ; ; "bf9bb7fbf1ff91d58b539cd8ed1955ac989fcc74" ; "Qin Lv" . ; a ; "Qing Li" ; "Li" ; "Qing" ; ; "d85fbbbc82e4736d65f53e72ac31cce03fa8c87a" ; "Qing Li" . ; a ; "Qirong Ho" ; "Ho" ; "Qirong" ; ; "dd521b21b5015d1baa7bf968de9d4906192bba24" ; "Qirong Ho" . ; a ; "Qiudan Li" ; "Li" ; "Qiudan" ; ; "8e5b1bc58ef7b85df976372bddaa216d838f982d" ; "Qiudan Li" . ; a ; "R. Ravi" ; "Ravi" ; "R." ; ; "34de8f5cc7b6f3b5e9b078bc0f64640cedfb205f" ; "R. Ravi" . ; a ; "R. Uday Kiran" ; ; "R. Uday Kiran" . ; a ; "Raffaele Perego" ; "Perego" ; "Raffaele" ; , ; "ae58120f14fae0ef8b81e89fe4e2442a712592a7" ; "Raffaele Perego" . ; , ; a ; "Rajeev Rastogi" ; "Rastogi" ; "Rajeev" ; ; "cf0ea0b02478506c9f486959b76152584cfaa8df" ; "Rajeev Rastogi" . ; ; a ; "Rajeev Sanghal" ; "Sanghal" ; "Rajeev" ; "616b6c0c193b05a10c03d3696f28159743b277a9" ; "Rajeev Sanghal" . ; a ; "Rajesh Parekh" ; "Parekh" ; "Rajesh" ; ; "7072bea8e06d85b570d992000ba2c859119089e5" ; "Rajesh Parekh" . ; a ; "Raju Balakrishnan" ; "Balakrishnan" ; "Raju" ; , ; "1900d6c105114158c1b87703437afedbb9ca4ee3" ; "Raju Balakrishnan" . ; a ; "Rakesh Agrawal" ; "Agrawal" ; "Rakesh" ; ; "9973d2af9afcf65c1abc22231296b12fe5c1a6c6" ; "Rakesh Agrawal" . ; a ; "Rakesh Babu" ; "Babu" ; "Rakesh" ; ; "f5d30401665244f2d56a12e0909e07f888bb0bbe" ; "Rakesh Babu" . ; a ; "Ram Akella" ; "Akella" ; "Ram" ; ; "a82a09887148b86ef0042817d18ff1f9f74d9480" ; "Ram Akella" . ; ; a ; "Ramasuri Narayanam" ; "Narayanam" ; "Ramasuri" ; "d7a94ca50315c94b07ca321c9318410cfe4e2e1b" ; "Ramasuri Narayanam" . ; a ; "Ramesh Jain" ; "Jain" ; "Ramesh" ; , ; "250eaa0f21ae21a031818972794cf382284330cd" ; "Ramesh Jain" . ; ; a ; "Ramkumar Narayan" ; "Narayan" ; "Ramkumar" ; "c327cfdeca39de5e67612d853796801808138cb1" ; "Ramkumar Narayan" . ; a ; "Randall A. Lewis" ; "Lewis" ; "Randall" ; ; "c1f5a34778f7a9fab2b8fe114b0f4685615c6035" ; "Randall A. Lewis" . ; a ; "Ravi Gummadi" ; "Gummadi" ; "Ravi" ; ; "9e6aecbe129b81315819d1065b42a599054c16e1" ; "Ravi Gummadi" . ; a ; "Ravi Kumar" ; ; "Ravi Kumar" . ; a ; "Raymond Heatherly" ; "Heatherly" ; "Raymond" ; ; "daf5014a6b679bf26bc1454fc88ecce03b574f23" ; "Raymond Heatherly" . ; ; a ; "Ricardo Baeza-Yates" ; "Baeza Yates", "Baeza-Yates" ; "Ricardo" ; "6b8157ddd763ec2cc90a2379ac468fab52ad5c13", "8c80b5e642614ff9eb28a474ffb4190860ea83f5" ; "Ricardo Baeza-Yates" . ; a ; "Richard Han" ; "Han" ; "Richard" ; ; "323ade74047264dbd1a734ee552cf5c89576c8fd" ; "Richard Han" . ; a ; "Rick Barber" ; "Barber" ; "Rick" ; , ; "36675c2ed723bb134b2419f6cac9e3de62dd5c9f" ; "Rick Barber" . ; a ; "Riddhiman Ghosh" ; "Ghosh" ; "Riddhiman" ; ; "8d1b83e59c9637b0a22530c6a2877d176adf4cd6" ; "Riddhiman Ghosh" . ; a ; "Rifat Ozcan" ; "Ozcan" ; "Rifat" ; ; "9df8982dc422b404db76ebd786c475dc81aef997" ; "Rifat Ozcan" . ; a ; "Rishiraj Saha Roy" ; "Saha Roy" ; "Rishiraj" ; ; "e7c34e3bfd9ad3e486c6235d4eb0f0de93a0050e" ; "Rishiraj Saha Roy" . ; a ; "Ritesh Kumar" ; "Kumar" ; "Ritesh" ; ; "b1ed86beb0b9489821175bf3a11ad078d922ea68" ; "Ritesh Kumar" . ; a ; "Roelof van Zwol" ; "Zwol" ; "Roelof" ; ; "d309ec91b77d523a03f6ea9ca321fbaa76c2695c" ; "Roelof van Zwol" . ; a ; "Rohit G. Bharadwaj" ; "Bharadwaj" ; "Rohit" ; ; "4771a4d777e44a5494bffd4b456c96587ad116e6" ; "Rohit G. Bharadwaj" . ; a ; "Rong Xiao" ; "Xiao" ; "Rong" ; ; "6600f37377ea9748b671f9ab926f5d1543374fed" ; "Rong Xiao" . ; a ; "Ronny Lempel" ; "Lempel" ; "Ronny" ; ; "baeb7c490f55192b3b2b4b6186b9c3b56578ccf9" ; "Ronny Lempel" . ; a ; "Rosie Jones" ; "Jones" ; "Rosie" ; ; "3df3c1582850a4396f5e321a4860a19be9dae835" ; "Rosie Jones" . ; a ; "Rossano Venturini" ; "Venturini" ; "Rossano" ; ; "343e3c590b71cc305323e5e4f42f55f5b8e0f9fb" ; "Rossano Venturini" . ; a ; "Ruben Verborgh" ; "Verborgh" ; "Ruben" ; ; "4f3f9bd3221fd7f3f11fef0498b348781608eb67" ; "Ruben Verborgh" . ; a ; "Rui Yan" ; "Yan" ; "Rui" ; ; "37e13055a38d0189e43a5be3ecb82444f14af6c8" ; "Rui Yan" . ; a ; "Rui Yang" ; "Yang" ; "Rui" ; ; "bbf99e2128193b048f2b7ee3750376d03734e203" ; "Rui Yang" . ; a ; "Ruiqiang Zhang" ; "Zhang" ; "Ruiqiang" ; ; "5c86dffcc6f2bcb753bad18e6be5687af81f397c" ; "Ruiqiang Zhang" . ; a ; "Ruofei Zhang" ; "Zhang" ; "Ruofei" ; ; "02f7977c8e081c93216bc505f5840e29122a4bfd" ; "Ruofei Zhang" . ; a ; "Rushi Bhatt" ; "Bhatt" ; "Rushi" ; ; "cc78e8d00228d032df72582203663fabb076e843" ; "Rushi Bhatt" . ; a ; "Russell Power" ; "Power" ; "Russell" ; ; "3c19a8048930d64c52d62f2b82dd356214281a51" ; "Russell Power" . ; a ; "Ryen W. White" ; "White" ; "Ryen" ; , ; "818b4c099c72fe6aa98a02bdd391a364d3c98414" ; "Ryen W. White" . ; a ; "Ryoji Kataoka" ; "Kataoka" ; "Ryoji" ; ; "1f59df94148b199937b16400c557b44fb15ef72b" ; "Ryoji Kataoka" . ; a ; "S. Bhargav" ; ; "S. Bhargav" . ; a ; "S. Muthukrishnan" ; "Muthukrishnan" ; "S" ; ; "d9fc0c4d8d155ea16dacfdba8b34405c896f060e" ; "S. Muthukrishnan" . ; a ; "S. Sadagopan" ; ; "S. Sadagopan" . ; a ; "S. Sundararajan" ; , ; "S. Sundararajan" . ; a ; "Sadiye Alici" ; "Alici" ; "Sadiye" ; ; "57797d98bfc22f169c73da57ac67f5642040876f" ; "Sadiye Alici" . ; a ; "Sahely Bhadra" ; "Bhadra" ; "Sahely" ; ; "46126243b45442584623e571677cdab704237c9f" ; "Sahely Bhadra" . ; a ; "Saket S. R. Mengle" ; "Mengle" ; "Saket" ; ; "bdddd2ca9059c44f0f6ddc24749aa80f1b3ae1f0" ; "Saket S. R. Mengle" . ; a ; "Salvatore Scellato" ; "Scellato" ; "Salvatore" ; ; "3f6fb3c987fa1b38d6b65bf9897141aa9d903489" ; "Salvatore Scellato" . ; a ; "Salvatore Vadacca" ; "Vadacca" ; "Salvatore" ; ; "a8433581e295b3e077d459136169154c817334cf" ; "Salvatore Vadacca" . ; a ; "Samik Basu" ; "Basu" ; "Samik" ; ; "2155974360c13842a5420e08386219bab35649b8" ; "Samik Basu" . ; a ; "Sandeepkumar Satpal" ; "Satpal" ; "Sandeepkumar" ; ; "410903ba0379fdcc5cf159365baae5923fe282bc" ; "Sandeepkumar Satpal" . ; a ; "Sang-goo Lee" ; "Lee" ; "Sang-goo" ; ; "95b6e2df840baf3b544672060866e0cc47d60315" ; "Sang-goo Lee" . ; a ; "Sang-Wook Kim" ; "Kim" ; "Sang-Wook" ; ; "85492690d37298e89a0a24faf98ff55c953ce587" ; "Sang-Wook Kim" . ; a ; "Sangkeun Lee" ; "Lee" ; "Sangkeun" ; ; "7c513b0b51bbe944d24a13509146275e3d3cb483" ; "Sangkeun Lee" . ; a ; "Sanil Salvi" ; "Salvi" ; "Sanil" ; ; "0664382e569fdc6cc51c1150ffd3be4d61bf3b59" ; "Sanil Salvi" . ; a ; "Santiago M. Mola-Velasco" ; "Mola-Velasco" ; "Santiago" ; ; "a8459d6c93059a73b0822a7b3f1d883545f7f6ef" ; "Santiago M. Mola-Velasco" . ; a ; "Saptarshi Ghosh" ; "Ghosh" ; "Saptarshi" ; , ; "542ed5a4b81952d4458462d6d6f4332da6a2b2dd" ; "Saptarshi Ghosh" . ; a ; "Sayali Kulkarni" ; "Kulkarni" ; "Sayali" ; ; "c203624d39a372dad0ddf2defe87ec123e8fdcd8" ; "Sayali Kulkarni" . ; a ; "Sayan Bhattacharya" ; "Bhattacharya" ; "Sayan" ; ; "bb8a3c1f92f34429269add2a49330a8c110c3e61" ; "Sayan Bhattacharya" . ; a ; "Sebastian Belle" ; ; "Sebastian Belle" . ; a ; "Sebastian Graf" ; "Graf" ; "Sebastian" ; ; "d853456ee86ed2322b790f1b369d60da6ce361c5" ; "Sebastian Graf" . ; a ; "Sebastian Rudolph" ; "Rudolph" ; "Sebastian" ; ; "3978a158ccbe5280fc11aa4b2900023f63ae9658" ; "Sebastian Rudolph" . ; a ; "Sebastiano Vigna" ; "Vigna" ; "Sebastiano" ; , ; "e3e2a36801700720f9918bdcca991731351d4698" ; "Sebastiano Vigna" . ; ; a ; "Selvam Velmurugan" ; "Velmurugan" ; "Selvam" ; "33ad504ad64cea907ac26dcaf255c3146fbb1201" ; "Selvam Velmurugan" . ; a ; "Seok-Ho Yoon" ; "Yoon" ; "Seok-Ho" ; ; "a550718e7e0cfdfe8598b29a3612b2dfaf42cdc1" ; "Seok-Ho Yoon" . ; a ; "Sergei Vassilvitskii" ; "Vassilvitskii" ; "Sergei" ; , ; "8deb2be1935bffd04d6a5ffdd54b124f2d4de887" ; "Sergei Vassilvitskii" . ; a ; "Shady Elbassuoni" ; "Elbassuoni" ; "Shady" ; ; "178fc75788e97950f547559bfa0bcee630ec30f5" ; "Shady Elbassuoni" . ; a ; "Shaomei Wu" ; "Wu" ; "Shaomei" ; , ; "b5cbd43462798cda28f3ae73bce9d65c189e3b42" ; "Shaomei Wu" . ; a ; "Shaoping Ma" ; "Ma" ; "Shaoping" ; ; "f6ee9c3302d9fe5a06a1f0dcc98b770753d1653a" ; "Shaoping Ma" . ; a ; "Sharad Mehrotra" ; "Mehrotra" ; "Sharad" ; ; "e372ec4f5f9cba25f0f4e4f59fe9d4813b96a440" ; "Sharad Mehrotra" . ; a ; "Shaul Markovitch" ; "Markovitch" ; "Shaul" ; ; "60fe623bd4d775582a154d7fdc4111d7e5b1c695" ; "Shaul Markovitch" . ; a ; "Shenwei Liu" ; "Liu" ; "Shenwei" ; ; "d87cd690572aa4bbeed3090b7a56b7c25cafec3e" ; "Shenwei Liu" . ; a ; "Shicong Feng" ; "Feng" ; "Shicong" ; ; "88056e311522ed9575ebd98ace84acd051eb560b" ; "Shicong Feng" . ; a ; "Shirshanka Das" ; "Das" ; "Shirshanka" ; ; "e4d3dd35acb7eae43db92072a5b00adb4981e8cb" ; "Shirshanka Das" . ; a ; "Shivakant Mishra" ; "Mishra" ; "Shivakant" ; ; "63a8369f66c794dd25901da39e8e1d3d5ec9a35c" ; "Shivakant Mishra" . ; a ; "Shou-De Lin" ; "Lin" ; "Shou-De" ; ; "7433c42feb4ab10ea7a74d571ec0b7503e1dcf24" ; "Shou-De Lin" . ; a ; "Shrey Sahay" ; "Sahay" ; "Shrey" ; ; "7614b7781a0d5425e5554a951388a718250f6fa0" ; "Shrey Sahay" . ; a ; "Shuang-Hong Yang" ; "Yang" ; "Shuang-Hong" ; ; "6d8c76220f4f7f21223cfaddf6d0d7317561bded" ; "Shuang-Hong Yang" . ; a ; "Shuicheng Yan" ; "Yan" ; "Shuicheng" ; ; "01d31d57fd9d51d3a3a8f4372f0e1ede2be9e85f" ; "Shuicheng Yan" . ; a ; "Sibren Isaacman" ; "Isaacman" ; "Sibren" ; ; "d70f8dc84ca283619ccce6404334d5e210ae7d53" ; "Sibren Isaacman" . ; a ; "Sicong Shou" ; "Shou" ; "Sicong" ; ; "f424e8d149a38e32d60c51de97c29771ae05aed3" ; "Sicong Shou" . ; a ; "Sidan Gao" ; "Gao" ; "Sidan" ; ; "b3f6bf5c6cac633aa5383f4df5c67c525f3ba723" ; "Sidan Gao" . ; ; a ; "Siddharth Suri" ; "Suri" ; "Siddharth" ; ; "0b7b415c93bfafe8444dcc55302e5b3211820d85" ; "Siddharth Suri" . ; a ; "Silvio Lattanzi" ; "Lattanzi" ; "Silvio" ; ; "6132264f6412c33b7ecaaaf9e9b398efbc647f8b" ; "Silvio Lattanzi" . ; a ; "Silviu Maniu" ; "Maniu" ; "Silviu" ; ; "677543282ff6038136a7eda12b08ece247861cd5" ; "Silviu Maniu" . ; a ; "Simla Ceyhan" ; "Ceyhan" ; "Simla" ; ; "ed99fb0f9f8799ae286476980db68fe4d40b4dba" ; "Simla Ceyhan" . ; a ; "Sipat Triukose" ; "Triukose" ; "Sipat" ; ; "f8bef2407812fe75d634f305ee666901881a0f6c" ; "Sipat Triukose" . ; a ; "Sitaram Asur" ; "Asur" ; "Sitaram" ; ; "8225096efdb2e441563068cf2fcd28a1104c7124" ; "Sitaram Asur" . ; a ; "Siva Gurumurthy" ; "Gurumurthy" ; "Siva" ; ; "641187ae4c8fdf8a9067000529c0d7aaf28abc2c" ; "Siva Gurumurthy" . ; a ; "Snehal Patil" ; "Patil" ; "Snehal" ; ; "649d6a2f49c8779308027e8f29654da7e8f7e808" ; "Snehal Patil" . ; a ; "Sören Auer" ; "Auer" ; "Sören" ; ; "55939ff4dcb8118526b10050cdf52ed1b8a7f611" ; "Sören Auer" . ; a ; "Songyun Duan" ; "Duan" ; "Songyun" ; , ; "62be488465038037aec8cbd924bdacd666ad68d8" ; "Songyun Duan" . ; a ; "Sotiris Ioannidis" ; "Ioannidis" ; "Sotiris" ; ; "174d4fa98c0253cb5ca351f9c621f2541facb274" ; "Sotiris Ioannidis" . ; a ; "Sougata Mukherjea" ; "Mukherjea" ; "Sougata" ; ; "b576b3f165b884a07f93606142f412f0c5bf6d1e" ; "Sougata Mukherjea" . ; ; a ; "Soumen Chakrabarti" ; "Chakrabarti" ; "Soumen" ; , ; "1b5a9fd203249ee2e5e4bb9f293a6f4073a22fee" ; "Soumen Chakrabarti" . ; a ; "Sourangshu Bhattachaya" ; "Bhattachaya" ; "Sourangshu" ; ; "dc159ca8a31cacc7f43102d589b0b30166141a75" ; "Sourangshu Bhattachaya" . ; ; a ; "Spyros Kotoulas" ; "Kotoulas" ; "Spyros" ; "6946d8442f70b89ce4660977933dbad510882f4b" ; "Spyros Kotoulas" . ; a ; "Spyros Zoupanos" ; "Zoupanos" ; "Spyros" ; ; "2d750b67769f4c7e8886964e8b2e2fe079242a83" ; "Spyros Zoupanos" . ; a ; "Srdjan ÄŒapkun" ; "Capkun" ; "Srdjan" ; ; "a2c7890bb09115895f39072ab998879cf202f98b" ; "Srdjan ÄŒapkun" . , ; a ; "Sreenivas Gollapudi" ; "Gollapudi" ; "Sreenivas" ; , ; "789de269da11110c3b672311188236fa0a757f69" ; "Sreenivas Gollapudi" . ; ; a ; "Srinivas Bangalore" ; "Bangalore" ; "Srinivas" ; "f952d41d858046813bec6b1c0d6f4e9e0e5efc0f" ; "Srinivas Bangalore" . ; a ; "Srinivas Vadrevu" ; "Vadrevu" ; "Srinivas" ; , ; "2727f16c09c6b33e54a4cfadd9cac697310e5ddc" ; "Srinivas Vadrevu" . ; a ; "Srinivasan H. Sengamedu" ; "Sengamedu" ; "Srinivasan" ; ; "cf32105d060bc9a59b545da9f8586217de1b7993" ; "Srinivasan H. Sengamedu" . ; a ; "Sriram Srinivasan" ; "Srinivasan" ; "Sriram" ; ; "fba51e00574a9a98fe47330415bfd1555b9a61ee" ; "Sriram Srinivasan" . ; a ; "Srivatsan Laxman" ; "Laxman" ; "Srivatsan" ; ; "46bbc59b138d9274ec0ea309e4290c2aef68c99c" ; "Srivatsan Laxman" . ; a ; "Srujana Merugu" ; "Merugu" ; "Srujana" ; ; "a2889b5161f214f32e519bd4d7b5e58be77d8579" ; "Srujana Merugu" . ; a ; "Stefan Siersdorfer" ; "Siersdorfer" ; "Stefan" ; ; "314b5e69cf7d1293a1074d2e01a64a7cdab675ae" ; "Stefan Siersdorfer" . ; a ; "Stefano Ceri" ; "Ceri" ; "Stefano" ; ; "d6cccf0545817704bb7af4bf59dfbfd8cf5d0a55" ; "Stefano Ceri" . ; a ; "Stephen Tyree" ; "Tyree" ; "Stephen" ; ; "f7ce01280dbe8cef180ea7ac706a9b6e66bd7e41" ; "Stephen Tyree" . ; a ; "Stuart Clarke" ; "Clarke" ; "Stuart" ; ; "4dbf68d02921347e20029772ce981a5cc35d0e8b" ; "Stuart Clarke" . ; a ; "Subbarao Kambhampati" ; "Kambhampati" ; "Subbarao" ; , , ; "3b55dcc2d0545d049fc4bb750e38f3b9320989d0" ; "Subbarao Kambhampati" . ; a ; "Subhajit Sanyal" ; "Sanyal" ; "Subhajit" ; ; "e2b9c800b8bb2dd823cbdb757ddce248e1402ec3" ; "Subhajit Sanyal" . ; a ; "Sui Huang" ; "Huang" ; "Sui" ; ; "fbf739129fb099cb1dbafebfa382b3154a4fdd58" ; "Sui Huang" . ; a ; "Sujian Li" ; "Li" ; "Sujian" ; ; "3ae0ef4c0fe7b331e13302511e27932c5c338cd7" ; "Sujian Li" . ; a ; "Sunandan Chakraborty" ; "Chakraborty" ; "Sunandan" ; ; "7fed4365eefe3e20458e5b966dd1dbf25079a68d" ; "Sunandan Chakraborty" . ; a ; "Sunil Arvindam" ; "Arvindam" ; "Sunil" ; ; "1db13e836fbd251e38ff08e29df023f56b42cbe3" ; "Sunil Arvindam" . ; a ; "Surajit Chaudhuri" ; "Chaudhuri" ; "Surajit" ; ; "bf4f8b1332652143fbb462a970f1bbac720464af" ; "Surajit Chaudhuri" . ; a ; "Susan Dumais" ; "Dumais" ; "Susan" ; ; "75c75f6867a497e1e892b5a9f926fff8c08df665" ; "Susan Dumais" . ; a ; "Sven Groppe" ; "Groppe" ; "Sven" ; ; "6257037900479835b9fbbc74e96a17eb9d4a3ed5" ; "Sven Groppe" . ; a ; "Swaprava Nath" ; "Nath" ; "Swaprava" ; ; "32cae536dbf140eb4ccc3aa6a59db71870f6d6d3" ; "Swaprava Nath" . ; a ; "Sylvester Olubolu Orimaye" ; "Orimaye" ; "Sylvester Olubolu" ; ; "d8b6b5b31f7e819a6af768fa29a39663214647a4" ; "Sylvester Olubolu Orimaye" . ; a ; "Taesup Moon" ; "Moon" ; "Taesup" ; ; "6ce0af02b8475483afb4399429562eb9ff0949a4" ; "Taesup Moon" . ; ; a ; "Taifeng Wang" ; "Wang" ; "Taifeng" ; "7596510a272daaaad2a5ea3d0b3325b881e23a4d" ; "Taifeng Wang" . ; a ; "Takeharu Eda" ; "Eda" ; "Takeharu" ; ; "781f9e8ada96970336ddb9c9f3f5f6f7242287b6" ; "Takeharu Eda" . ; a ; "Talel Abdessalem" ; "Abdessalem" ; "Talel" ; ; "95ed60ab747c392dab6376c3e13583f44152df13" ; "Talel Abdessalem" . ; a ; "Tao Bao" ; "Bao" ; "Tao" ; ; "a29118cc493f4a2ec3b264580ed55d782f642a50" ; "Tao Bao" . ; a ; "Tao Cheng" ; "Cheng" ; "Tao" ; ; "b292d2e27ae9d9301558d8118292da58a98e6d4d" ; "Tao Cheng" . ; a ; "Tao Meng" ; "Meng" ; "Tao" ; ; "1fb0b2aae7dc330a8aaf45b7cdf9b68b806c248d" ; "Tao Meng" . ; a ; "Tapas Kanungo" ; "Kanungo" ; "Tapas" ; ; "7f9421e4f791b3b563b4d0fdf258cf4d0276fc93" ; "Tapas Kanungo" . ; a ; "Tat-Seng Chua" ; "Chua" ; "Tat-Seng" ; ; "272b120007c917533736dfb75dd5026b434aaa43" ; "Tat-Seng Chua" . ; a ; "Tatsushi Matsubayashi" ; "Matsubayashi" ; "Tatsushi" ; ; "d11a3e79095f7088f27515ea5e90ce460daeffc9" ; "Tatsushi Matsubayashi" . ; a ; "Tevfik Bultan" ; "Bultan" ; "Tevfik" ; ; "4cab2670cd54dcbb2a410b32389700f0ca604f22" ; "Tevfik Bultan" . ; a ; "Thomas Huang" ; "Huang" ; "Thomas" ; , ; "ce6b340126b0700dc0a4215c478ea7d5dd4791d5", "e8601a72adfbcd5c0839e238691ffd8f9ff0409f" ; "Thomas Huang" . ; a ; "Thomas Karagiannis" ; "Karagiannis" ; "Thomas" ; ; "c9e1444a2339e291177501ade288d24f2c4a8291" ; "Thomas Karagiannis" . ; ; a ; "Tie-Yan Liu" ; "Liu" ; "Tie-Yan" ; "3ee8d73be9c076ac0db4e7d33dd8ab1d336c0664" ; "Tie-Yan Liu" . ; a ; "Tieyun Qian" ; "Qian" ; "Tieyun" ; ; "4ff6b9314cccadb00cb0f010399e161b073d56a1" ; "Tieyun Qian" . ; a ; "Tim Furche" ; "Furche" ; "Tim" ; ; "8609ba52f689387e18b59421a82e7eea433cee46" ; "Tim Furche" . ; a ; "Tim Weninger" ; "Weninger" ; "Tim" ; , ; "b5357594bbf49d1d200093b4489043c8e43c98ca" ; "Tim Weninger" . ; a ; "Timofey Ermilov" ; "Ermilov" ; "Timofey" ; ; "b7f2898b4373b0063f7c58d5341d6b1b4892f098" ; "Timofey Ermilov" . ; a ; "Ting Wang" ; "Wang" ; "Ting" ; ; "112b0cfded3db633279e6d34d4aefb61bd23d0a2" ; "Ting Wang" . ; a ; "Tok Wang Ling" ; "Ling" ; "Tok Wang" ; ; "6450e6a546d4ee6a4a55f05193b65ff58fd21408" ; "Tok Wang Ling" . ; a ; "Tom Yeh" ; "Yeh" ; "Tom" ; ; "7c95c97a5790112c5ca59c290318f60208678d09" ; "Tom Yeh" . ; a ; "Tomasz Tylenda" ; "Tylenda" ; "Tomasz" ; ; "1ecc2c81fa1cdcabacef1c53ebd55cf4d2dbeea6" ; "Tomasz Tylenda" . ; a ; "Toshio Uchiyama" ; "Uchiyama" ; "Toshio" ; ; "2d95e19a3f5641f7b99f550b12c0ecf1192987ea" ; "Toshio Uchiyama" . ; a ; "Tran Anh Tuan" ; "Tuan" ; "Tran" ; ; "b54b74fe320f29350e602c07b192c9d86a22b1f3" ; "Tran Anh Tuan" . ; a ; "Umeshwar Dayal" ; "Dayal" ; "Umeshwar" ; , ; "81fa13005c83ca67989beb7cae4a4c2eb4fa1753" ; "Umeshwar Dayal" . ; a ; "Umut Ozertem" ; "Ozertem" ; "Umut" ; ; "68cfe6fa652c90eec68c813181ec3bfa9ea83c85" ; "Umut Ozertem" . ; a ; "Valter Crescenzi" ; "Crescenzi" ; "Valter" ; ; "0bc3cc333da99f7ea03d0d1709c6eb4bebef20fd" ; "Valter Crescenzi" . ; a ; "Vanja Josifovski" ; "Josifovski" ; "Vanja" ; , ; "31f60ca3508d36cb1cbf1fc24c9694dcf34818dd" ; "Vanja Josifovski" . , ; a ; "Vasudeva Varma" ; "Varma" ; "Vasudeva" ; , ; "e900af6b044c8dc7c3c6f4c4c05741cb74d4edd0" ; "Vasudeva Varma" . ; a ; "Veljko Pejovic" ; "Pejovic" ; "Veljko" ; ; "ef6d0f71eca70153b6414bac8050dc67a8d2452d" ; "Veljko Pejovic" . ; a ; "Venkatasubramanian Suresh" ; ; "Venkatasubramanian Suresh" . ; a ; "Victoria Nebot" ; ; "Victoria Nebot" . ; a ; "Vidit Jain" ; "Jain" ; "Vidit" ; ; "f232d98ec07bde21ed95304b26ba90cb43f2632c" ; "Vidit Jain" . ; a ; "Vikram Pudi" ; "Pudi" ; "Vikram" ; ; "6f9b36306fa55faafe65523557eb4d5c8e379fce" ; "Vikram Pudi" . ; a ; "Wang-Chien Lee" ; "Lee" ; "Wang-Chien" ; ; "1ef16d1f1efe4d4d09215e1220ad8b9a00a05eae" ; "Wang-Chien Lee" . ; a ; "Wangchao Le" ; "Le" ; "Wangchao" ; ; "af587db2db05318c75e91d0881e04b7f8172e5e9" ; "Wangchao Le" . ; a ; "Wei Dong" ; "Dong" ; "Wei" ; ; "311582a29c48da5450ba4318f5279f2e86352cc7" ; "Wei Dong" . ; a ; "Wei Hu" ; "Hu" ; "Wei" ; ; "53bf2b6ccb9cad6db33c480ed59e490065eb391b" ; "Wei Hu" . ; a ; "Wei Li" ; "Li" ; "Wei" ; ; "72b5779e25caa54de2c0181b8eed328fe68c9d77" ; "Wei Li" . ; a ; "Wei Lu" ; "Lu" ; "Wei" ; ; "b3c08ad5f8eb53b90be4ab7b9c7ed807943ff0d5" ; "Wei Lu" . ; a ; "Wei Shen" ; "Shen" ; "Wei" ; ; "ac05a57b08e25b6fdb99a3cfb7b310aa10f2da00" ; "Wei Shen" . ; a ; "Wei Wu" ; "Wu" ; "Wei" ; ; "c8849cd9f8d7c428c4ca42423a2edb33c6d450f3" ; "Wei Wu" . ; a ; "Weiyi Ge" ; "Ge" ; "Weiyi" ; ; "13cf4521e088330644118ac8125d58debf194709" ; "Weiyi Ge" . , ; a ; "Weizhu Chen" ; "Chen" ; "Weizhu" ; ; "64e84dc9b9ce66c9f6f3f7239f6212021d11382d" ; "Weizhu Chen" . ; a ; "Wenjie Li" ; "Li" ; "Wenjie" ; ; "a097e361397623b914585e71e1c2d121c47ce2e1" ; "Wenjie Li" . ; a ; "Wenke Lee" ; "Lee" ; "Wenke" ; ; "33c4d0739b0f2c751d0e24994cfe9ac41bb0717a" ; "Wenke Lee" . ; a ; "Wenxuan Shi" ; "Shi" ; "Wenxuan" ; ; "07dc731247131b763aa6467c8be83d474b7e6585" ; "Wenxuan Shi" . ; a ; "Wenyun Zhao" ; "Zhao" ; "Wenyun" ; ; "dd61ef07469b19db9a998f7605b710b4257280ae" ; "Wenyun Zhao" . ; a ; "Wenzhao Tan" ; "Tan" ; "Wenzhao" ; , ; "56e96ffc29195e1bf7d2b60cbfda9152fbd1d96d" ; "Wenzhao Tan" . ; a ; "Werner Geyer" ; "Geyer" ; "Werner" ; ; "1bc5cda3b257d1f60829e951d9ae97cd3e6c367e" ; "Werner Geyer" . ; a ; "William Thies" ; "Thies" ; "William" ; ; "fc5eb5cec3dba4b534a14b7dcf68ae08a3935ed2" ; "William Thies" . ; a ; "Winston H. Hsu" ; "Hsu" ; "Winston H." ; ; "46262123311f748602fa04dfd943ab0a7ee616b6" ; "Winston H. Hsu" . ; a ; "Winter A. Mason" ; "Mason" ; "Winter" ; ; "d0b3c7725962ffd706bd8c63fd404f90ac1cac19" ; "Winter A. Mason" . ; a ; "Wojciech Galuba" ; "Galuba" ; "Wojciech" ; ; "74a2269ec2328b468d1a501be0075706cae70e4d" ; "Wojciech Galuba" . ; a ; "Wolf Siberski" ; "Siberski" ; "Wolf" ; ; "7229fd85c0f39b95b5b438d39824683c54baea02" ; "Wolf Siberski" . ; a ; "Won-Seok Hwang" ; "Hwang" ; "Won-Seok" ; ; "8ab8f3d78fedc5fbd18d8742d3f7bfa994984060" ; "Won-Seok Hwang" . ; a ; "Wonhong Nam" ; "Nam" ; "Wonhong" ; ; "dad1b6981001c400ebdc7fef4191809a933e20d1" ; "Wonhong Nam" . ; a ; "Xi Bai" ; "Bai" ; "Xi" ; ; "539e18965dba0dab1ba32510e5b2fa5079a775e1" ; "Xi Bai" . ; a ; "Xian-Sheng Hua" ; "Hua" ; "Xian-Sheng" ; ; "40389c9c0a7cc5b00b5e4cb4676023cce4645c15" ; "Xian-Sheng Hua" . ; a ; "Xiangyu Zhang" ; "Zhang" ; "Xiangyu" ; ; "7b1fb2af67c472df488002767c13ac1b4a57ce47" ; "Xiangyu Zhang" . ; a ; "Xiaofang Zhou" ; ; "Xiaofang Zhou" . ; a ; "Xiaofei Zhu" ; "Zhu" ; "Xiaofei" ; ; "c707b32898d45bf5a7b9b16e27aab5a42d604e82" ; "Xiaofei Zhu" . ; a ; "Xiaoguang Qi" ; "Qi" ; "Xiaoguang" ; ; "03a49866184604bc9cdd9f5315baa830a2ca4b3b" ; "Xiaoguang Qi" . ; a ; "Xiaolin Shi" ; "Shi" ; "Xiaolin" ; ; "2bca8333b285b83c9e141f69f64065a7a826eb00" ; "Xiaolin Shi" . ; a ; "Xiaoming Li" ; "Li" ; "Xiaoming" ; ; "4d4ac9a833278ae7dcb4723b02f50be7aebc493f" ; "Xiaoming Li" . ; a ; "Xiaoxin Yin" ; "Yin" ; "Xiaoxin" ; , ; "8bbae475d9df49ada213dce1880beb080eb4da6c" ; "Xiaoxin Yin" . ; a ; "Xiaoyi Feng" ; "Feng" ; "Xiaoyi" ; ; "2076bfff896a9f288e5cce23b0052e338b32f3b0" ; "Xiaoyi Feng" . ; a ; "Xin Peng" ; "Peng" ; "Xin" ; ; "94b65c3cd9eac6c61cced0be5097016318da616a" ; "Xin Peng" . ; a ; "Xing Xie" ; "Xie" ; "Xing" ; ; "0da6df4bfae53fea459de0cfca2298f96e37605b" ; "Xing Xie" . ; a ; "Xingtian Shi" ; "Shi" ; "Xingtian" ; ; "6c8b831e136017cc341a9e442ffad9b16ebb65a0" ; "Xingtian Shi" . ; a ; "Xinyu Xing" ; "Xing" ; "Xinyu" ; ; "97e6b9f2049eff028eb6d123c396c2935a925e6a" ; "Xinyu Xing" . ; a ; "Xu Jia" ; "Jia" ; "Xu" ; ; "966f0dfd1daea239249c67bbc15bc490638febf1" ; "Xu Jia" . ; a ; "Xuanhui Wang" ; "Wang" ; "Xuanhui" ; ; "a3397a4634cfee5f98cd8dbb84d26d9b6077f1b6" ; "Xuanhui Wang" . ; a ; "Xue Liu" ; "Liu" ; "Xue" ; ; "5743982d4347336f336706b2328eabc43a89bf6f" ; "Xue Liu" . ; a ; "Xueke Xu" ; "Xu" ; "Xueke" ; ; "8bd1b147853c04e52836397e7fa401c2121750c1" ; "Xueke Xu" . ; a ; "Xueqi Cheng" ; "Cheng" ; "Xueqi" ; , ; "6ed9049595ba3b5fd98a172434447c539e225267" ; "Xueqi Cheng" . ; ; a ; "Yadati Narahari" ; "Yadati Narahari" . ; a ; "Yafang Wang" ; "Wang" ; "Yafang" ; ; "a5ad8398f2771dd410908118de8fc1b1f5303e7c" ; "Yafang Wang" . ; a ; "Yajun Wang" ; "Wang" ; "Yajun" ; ; "1f673d24befed6c530944cfa52b74686d50d28ec" ; "Yajun Wang" . ; a ; "Yalou Huang" ; "Huang" ; "Yalou" ; ; "73c93f857a04878c4bba3127fe645edeb7e360ad" ; "Yalou Huang" . ; a ; "Yan-Ying Chen" ; "Chen" ; "Yan-Ying" ; ; "25b2ec9dbea8f8a7c9abdf0b432ac7f1eaee0aa9" ; "Yan-Ying Chen" . ; a ; "Yan Zhang" ; "Zhang" ; "Yan" ; ; "1dfd5d2423e245f7ebfa81d2b18e7cd25fec4527" ; "Yan Zhang" . ; a ; "Yana Volkovich" ; "Volkovich" ; "Yana" ; ; "f31d0cdca130e6559edf8df1aabc78c86b005ee5" ; "Yana Volkovich" . ; a ; "Yaron Kanza" ; "Kanza" ; "Yaron" ; ; "2cb6bec282b0b32d177ce4cb69d464f89ee80fef" ; "Yaron Kanza" . ; a ; "Yelong Shen" ; "Shen" ; "Yelong" ; ; "2a503919a5f9dc15fac61a10749808479b1b16d9" ; "Yelong Shen" . ; a ; "Yeye He" ; "He" ; "Yeye" ; ; "c177a863ffcd1d8d2fd2808e9ae1ec6bb96d723e" ; "Yeye He" . ; a ; "Yi Chang" ; "Chang" ; "Yi" ; , ; "fce4c279d828379e9155860ebaeb8e90ff004222" ; "Yi Chang" . ; a ; "Yi Shen" ; "Shen" ; "Yi" ; ; "c341c3755127bff746abb4ed6ab6b038b2c25751" ; "Yi Shen" . ; a ; "Yijun Yu" ; "Yu" ; "Yijun" ; ; "cbc1c556390ea48c3c92394047af29cee7540882" ; "Yijun Yu" . ; a ; "Yiming Liu" ; "Liu" ; "Yiming" ; ; "25cfb93e33ed61734c6d8b8d612b5203c671df81" ; "Yiming Liu" . ; a ; "Ying Zhang" ; "Zhang" ; "Ying" ; ; "710b519eb81425c6d50dd809a9354e7f2562d0a3" ; "Ying Zhang" . ; a ; "Yinglian Xie" ; "Xie" ; "Yinglian" ; ; "e09349d1a1d96806dc42d5116adbd6c5b3e76cea" ; "Yinglian Xie" . ; a ; "Yiqun Liu" ; "Liu" ; "Yiqun" ; ; "48c764001fa22b420420c03f07f6d31aa583f2ef" ; "Yiqun Liu" . ; a ; "Yizhou Sun" ; "Sun" ; "Yizhou" ; ; "7be478771bc1182377539fa78cc7a69263668f88" ; "Yizhou Sun" . ; a ; "Yoelle Maarek" ; "Maarek" ; "Yoelle" ; ; "7dc548ecd58c068c6f481288165d758bac69fd35" ; "Yoelle Maarek" . ; a ; "Yong Yu" ; "Yu" ; "Yong" ; ; "cacc2c4bd9dd283b77e60e6d79009f4b081c651b" ; "Yong Yu" . ; a ; "Yookyung Jo" ; "Jo" ; "Yookyung" ; ; "ecffec0fe2753cb4b0651ed8aaa1bcf826f9d989" ; "Yookyung Jo" . ; a ; "Young Yoon" ; "Yoon" ; "Young" ; ; "68aaefd82bb59f8667742fdf79657fe18d6acd16" ; "Young Yoon" . ; a ; "Yu Li" ; "Li" ; "Yu" ; ; "efb4cb16f2f5bf79dfc1565edb8ee5083d48a57b" ; "Yu Li" . ; a ; "Yu-Li Liang" ; "Liang" ; "Yu-Li" ; ; "bfe4bf7cbd8653ab5754bf7914597d0a24d08f2d" ; "Yu-Li Liang" . ; a ; "Yuanhua Lv" ; "Lv" ; "Yuanhua" ; ; "ff3d6c0330623ac1b6006f18f93921453df5bb89" ; "Yuanhua Lv" . , ; a ; "Yuchen Zhang" ; "Zhang" ; "Yuchen" ; ; "e3412ba4a18d5572cb66f38d0029c7c080eddead" ; "Yuchen Zhang" . ; a ; "Yue Liu" ; "Liu" ; "Yue" ; ; "89172c8184e4febe0143571692cffbe9e8fd03b0" ; "Yue Liu" . , ; a ; "Yue Lu" ; "Lu" ; "Yue" ; , ; "43db5ddac3386c1df942f6cb8da8edb1598296db", "b3d55259376470b46ae6f946ada0f02a7ce8d568" ; "Yue Lu" . ; a ; "Yunhui Zheng" ; "Zheng" ; "Yunhui" ; ; "fcb61a4762b66f2bba36a367cec2ea5fdaa377dd" ; "Yunhui Zheng" . ; a ; "Yutaka Matsuo" ; "Matsuo" ; "Yutaka" ; , ; "d4025867d8d34605ce2ad5a9168b15eed4e3c850" ; "Yutaka Matsuo" . ; a ; "Yuzhong Qu" ; "Qu" ; "Yuzhong" ; , ; "995c383eb15c9b4ae9146c9db527fb44f243847f" ; "Yuzhong Qu" . ; a ; "Zeinab Abbassi" ; "Abbassi" ; "Zeinab" ; ; "58ccd951b5dfe3fa6a777d8fc5c7992de37f99f6" ; "Zeinab Abbassi" . ; a ; "Zenglin Xia" ; "Xia" ; "Zenglin" ; ; "257fe1a1954e1fd8bacd8a8d03156346c33fb197" ; "Zenglin Xia" . , ; a ; "Zhaohui Zheng" ; "Zheng" ; "Zhaohui" ; , ; "e37a2db18b750b2ba669539ffabf863c83d5d60f" ; "Zhaohui Zheng" . ; a ; "Zhen Wen" ; "Wen" ; "Zhen" ; ; "158c185597a14958ae52de8dda6d1bae581743fe" ; "Zhen Wen" . ; a ; "Zheng Chen" ; "Chen" ; "Zheng" ; , ; "a6ba9e2f82a57d187a361848fb9c268b6533ccc8" ; "Zheng Chen" . ; a ; "Zheng-Jun Zha" ; "Zha" ; "Zheng-Jun" ; ; "e411a710c71600ad2dffae2a81dfc97fcbd9d818" ; "Zheng-Jun Zha" . ; a ; "Zhenglu Yang" ; "Yang" ; "Zhenglu" ; ; "014cf70c189f2742474ee9955dea586d6fdc69f0" ; "Zhenglu Yang" . ; a ; "Zhihua Wen" ; "Wen" ; "Zhihua" ; ; "b568ad2ebc33d22251c550b567a15715aa16aa5b" ; "Zhihua Wen" . ; a ; "Zhijun Yin" ; "Yin" ; "Zhijun" ; ; "f55e02aadf85b31486521b2d15706d475d1ddbe1" ; "Zhijun Yin" . ; a ; "Ziv Bar-Yossef" ; "Bar-Yossef" ; "Ziv" ; ; "d945365c5862b412e34c691995be12259511d5e8" ; "Ziv Bar-Yossef" . a ; "Agents, Grids, and Services" ; "Agents, Grids, and Services" . a ; "Clustering" ; "Clustering" . a ; "Diffusion" ; "Diffusion" . a ; "E-commerce" ; "E-commerce" . a ; "Emerging Regions" ; "Emerging Regions" . a ; "Evaluation" ; "Evaluation" . a ; "Information Credibility" ; "Information Credibility" . a ; "Information Extraction" ; "Information Extraction" . a ; "Information Spread" ; "Information Spread" . a ; "Intent Understanding" ; "Intent Understanding" . a ; "Monetization" ; "Monetization" . a ; "Multimedia" ; "Multimedia" . a ; "Performance and Systems" ; "Performance and Systems" . a ; "Query Analysis" ; "Query Analysis" . a ; "Query and Ontology Languages" ; "Query and Ontology Languages" . a ; "Ranking" ; "Ranking" . a ; "Recommendation" ; "Recommendation" . a ; "Search Systems" ; "Search Systems" . a ; "Semantic Analysis" ; "Semantic Analysis" . a ; "Semantic Web" ; "Semantic Web" . a ; "Social Network Algorithms" ; "Social Network Algorithms" . a ; "Social Network Analysis" ; "Social Network Analysis" . a ; "Spatio-Temporal Analysis" ; "Spatio-Temporal Analysis" . a ; "Temporal Dynamics" ; "Temporal Dynamics" . a ; "Text Mining" ; "Text Mining" . a ; "Trust and Diversity" ; "Trust and Diversity" . a ; "User Interaction" ; "User Interaction" . a ; "Web Applications" ; "Web Applications" . a ; "Web, Context, Economy" ; "Web, Context, Economy" . a ; "Web Mining" ; "Web Mining" . a ; "Web Security" ; "Web Security" . a ; "Universidad de Chile" ; ; "Universidad de Chile" . "DiversiWeb 2011" ; ; a ; "First International Workshop on Knowledge Diversity on the Web" ; "2011-03-28T17:00:00+05:00" ; "2011-03-28T13:30:00+05:00" ; "First International Workshop on Knowledge Diversity on the Web" ; . "IIWeb 2011" ; ; a ; "Eighth International workshop on Information Integration on the Web" ; "2011-03-28T17:00:00+05:00" ; "2011-03-28T08:30:00+05:00" ; "Eighth International workshop on Information Integration on the Web" ; . "LDOW2011" ; ; a ; "Linked Data on the Web" ; "2011-03-29T17:00:00+05:00" ; "2011-03-29T08:30:00+05:00" ; "Linked Data on the Web" ; . "SemSearch 2011" ; ; a ; "4th Semantic Search Workshop" ; "2011-03-29T17:00:00+05:00" ; "2011-03-29T08:30:00+05:00" ; "4th Semantic Search Workshop" ; . "SoME 2011" ; ; a ; "First International Workshop on Social Media Engagement" ; "2011-03-29T17:00:00+05:00" ; "2011-03-29T08:30:00+05:00" ; "First International Workshop on Social Media Engagement" ; . "TWAW10" ; ; a ; "1st International Temporal Web Analytics Workshop" ; "2011-03-28T17:00:00+05:00" ; "2011-03-28T08:30:00+05:00" ; "1st International Temporal Web Analytics Workshop" ; . "USEWOD2011" ; ; a ; "1st International Workshop on Usage Analysis and the Web of Data" ; "2011-03-28T17:00:00+05:00" ; "2011-03-28T08:30:00+05:00" ; "1st International Workshop on Usage Analysis and the Web of Data" ; . "WebQuality 2011" ; ; a ; "Joint WICOW/AIRWeb Workshop on Web Quality" ; "2011-03-28T17:00:00+05:00" ; "2011-03-28T08:30:00+05:00" ; "Joint WICOW/AIRWeb Workshop on Web Quality" ; . "WS-REST2011" ; ; a ; "2nd International Workshop on RESTful Design" ; "2011-03-28T17:00:00+05:00" ; "2011-03-28T08:30:00+05:00" ; "2nd International Workshop on RESTful Design" ; . a ; "World Wide Web" ; "World Wide Web" .