aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
0706.2434 | 2143252188 | In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson cluster process on the plane. We derive the distributional properties of the interference and pr... | In @cite_8 , Ilow and Hatzinakos model the interference as a shot noise process and show that the interference is a symmetric @math -stable process @cite_7 when the nodes are Poisson distributed on the plane. They also show that channel randomness affects the dispersion of the distribution, while the path-loss exponent... | {
"cite_N": [
"@cite_14",
"@cite_22",
"@cite_7",
"@cite_8",
"@cite_9",
"@cite_23"
],
"mid": [
"2132987440",
"",
"1996124770",
"2120852651",
"39625332",
"2150780555"
],
"abstract": [
"An Aloha-type access control mechanism for large mobile, multihop, wireless... |
0706.2434 | 2143252188 | In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson cluster process on the plane. We derive the distributional properties of the interference and pr... | Even in the case of the PPP, the interference distribution is not known for all fading distributions and all channel attenuation models. Only the characteristic function or the Laplace transform of the interference can be obtained in most of the cases. The Laplace transform can be used to evaluate the outage probabilit... | {
"cite_N": [
"@cite_14",
"@cite_21"
],
"mid": [
"2132987440",
"1989970284"
],
"abstract": [
"An Aloha-type access control mechanism for large mobile, multihop, wireless networks is defined and analyzed. This access scheme is designed for the multihop context, where it is important to find... |
0706.2434 | 2143252188 | In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson cluster process on the plane. We derive the distributional properties of the interference and pr... | @cite_16 introduces the notion of transmission capacity , which is a measure of the area spectral efficiency of the successful transmissions resulting from the optimal contention density as a function of the link distance. Transmission capacity is defined as the product of the maximum density of successful transmission... | {
"cite_N": [
"@cite_16"
],
"mid": [
"2095796369"
],
"abstract": [
"In this paper, upper and lower bounds on the transmission capacity of spread-spectrum (SS) wireless ad hoc networks are derived. We define transmission capacity as the product of the maximum density of successful transmissions mul... |
0707.0648 | 2950368606 | The k-forest problem is a common generalization of both the k-MST and the dense- @math -subgraph problems. Formally, given a metric space on @math vertices @math , with @math demand pairs @math and a target'' @math , the goal is to find a minimum cost subgraph that connects at least @math demand pairs. In this paper, w... | The @math -forest problem: The @math -forest problem is relatively new: it was defined by Hajiaghayi & Jain @cite_20 . An @math -approximation algorithm for even the directed @math -forest problem can be inferred from @cite_19 . Recently, Segev & Segev @cite_10 gave an @math approximation algorithm for @math -forest. | {
"cite_N": [
"@cite_19",
"@cite_10",
"@cite_20"
],
"mid": [
"",
"2173641041",
"1971222832"
],
"abstract": [
"",
"An instance of the k-Steiner forest problem consists of an undirected graph G = (V,E), the edges of which are associated with non-negative costs, and a collection D... |
0707.0648 | 2950368606 | The k-forest problem is a common generalization of both the k-MST and the dense- @math -subgraph problems. Formally, given a metric space on @math vertices @math , with @math demand pairs @math and a target'' @math , the goal is to find a minimum cost subgraph that connects at least @math demand pairs. In this paper, w... | Dense @math -subgraph: The problem is a generalization of the problem @cite_8 , as shown in @cite_20 . The best known approximation guarantee for the problem is @math where @math is some constant, due to @cite_8 , and obtaining an improved guarantee has been a long standing open problem. Strictly speaking, @cite_8 stud... | {
"cite_N": [
"@cite_14",
"@cite_20",
"@cite_8"
],
"mid": [
"2038190710",
"1971222832",
"2062962786"
],
"abstract": [
"We present a polynomial time 2-approximation algorithm for the problem of finding the minimum tree that spans at least k vertices. Our result also leads to a 2-app... |
0707.0050 | 2164280180 | In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only their own channel (while perfect channel state information is ... | This section is dedicated to present some of the works that use game theory for power control. We remind that a Nash equilibrium is a stable solution, where no player has an incentive to deviate unilaterally, while a Pareto equilibrium is a cooperative dominating solution, where there is no way to improve the performan... | {
"cite_N": [
"@cite_31",
"@cite_11"
],
"mid": [
"2119866417",
"2167144534"
],
"abstract": [
"Game theory provides a wealth of tools that can be applied to the design and operation of communications systems. In this article, we provide a brief introduction to game theory. We then present a... |
0707.0050 | 2164280180 | In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only their own channel (while perfect channel state information is ... | In particular, the utility generally considered in those articles is justified in @cite_4 where the author describes a widely applicable model from first principles''. Conditions under which the utility will allow to obtain non-trivial Nash equilibria (i.e., users actually transmit at the equilibrium) are derived. The ... | {
"cite_N": [
"@cite_13",
"@cite_5",
"@cite_4"
],
"mid": [
"101021095",
"2108077180",
"2136157118"
],
"abstract": [
"",
"A major challenge in the operation of wireless communications systems is the efficient use of radio resources. One important component of radio resource mana... |
0707.0050 | 2164280180 | In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only their own channel (while perfect channel state information is ... | Unfortunately, Nash equilibria often lead to inefficient allocations, in the sense that higher rates (Pareto equilibria) could be obtained for all mobiles if they cooperated. To alleviate this problem, in addition to the non-cooperative game setting, @cite_5 introduces a pricing strategy to force users to transmit at a... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2108077180"
],
"abstract": [
"A major challenge in the operation of wireless communications systems is the efficient use of radio resources. One important component of radio resource management is power control, which has been studied extensively in the context... |
0707.0050 | 2164280180 | In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only their own channel (while perfect channel state information is ... | In @cite_17 , defining the utility as advised in @cite_4 as the ratio of the throughput to the transmission power, the authors obtain results of existence and unicity of a Nash equilibrium for a CDMA system. They extend this work to the case of multiple carriers in @cite_36 . In particular, it is shown that users will ... | {
"cite_N": [
"@cite_36",
"@cite_4",
"@cite_17"
],
"mid": [
"2148911784",
"2136157118",
"2104919411"
],
"abstract": [
"A game-theoretic model for studying power control in multicarrier code-division multiple-access systems is proposed. Power control is modeled as a noncooperative g... |
0707.0050 | 2164280180 | In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only their own channel (while perfect channel state information is ... | This work is an extension of @cite_17 in the case of frequency-selective fading, in the framework of multi-user systems. We do not consider multiple carriers, as in @cite_36 , and the results are very different to those obtained in that work. The extension is not trivial and involves advanced results on random matrices... | {
"cite_N": [
"@cite_14",
"@cite_36",
"@cite_19",
"@cite_40",
"@cite_17"
],
"mid": [
"2039953809",
"2148911784",
"2168150810",
"1593981206",
"2104919411"
],
"abstract": [
"A stronger result on the limiting distribution of the eigenvalues of random Hermitian matrices... |
0707.0050 | 2164280180 | In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only their own channel (while perfect channel state information is ... | Moreover, in addition to the linear filters studied in @cite_17 , we study the enhancements provided by the optimum and successive interference cancellation filters. | {
"cite_N": [
"@cite_17"
],
"mid": [
"2104919411"
],
"abstract": [
"In this paper, the cross-layer design problem of joint multiuser detection and power control is studied, using a game-theoretic approach that focuses on energy efficiency. The uplink of a direct-sequence code-division multiple-acc... |
0707.0546 | 2952386894 | We study the problem of assigning jobs to applicants. Each applicant has a weight and provides a preference list ranking a subset of the jobs. A matching M is popular if there is no other matching M' such that the weight of the applicants who prefer M' over M exceeds the weight of those who prefer M over M'. This paper... | Following the publication of the work of Abraham al @cite_11 , the topic of unweighted popular matchings has been further explored in many interesting directions. Suppose we want to go from an arbitrary matching to some popular matching by a sequence of matchings each more popular than the previous; Abraham and Kavitha... | {
"cite_N": [
"@cite_0",
"@cite_1",
"@cite_10",
"@cite_11"
],
"mid": [
"2471400471",
"1564148014",
"2040117841",
""
],
"abstract": [
"We consider a matching market, in which the aim is to maintain a popular matching between a set of applicants and a set of posts, where each... |
0707.1053 | 1672175433 | We present a deterministic exploration mechanism for sponsored search auctions, which enables the auctioneer to learn the relevance scores of advertisers, and allows advertisers to estimate the true value of clicks generated at the auction site. This exploratory mechanism deviates only minimally from the mechanism bein... | Moreover, as we discuss later in , the problem of designing a family of optimal exploratory mechanisms, which for example would provide the most information while minimizing expected loss in revenue is far from being solved. The work in @cite_3 and in this paper provide just two instances of mechanism design which do p... | {
"cite_N": [
"@cite_3"
],
"mid": [
"2108808125"
],
"abstract": [
"We introduce an exploration scheme aimed at learning advertiser click-through rates in sponsored search auctions with minimal effect on advertiser incentives. The scheme preserves both the current ranking and pricing policies of th... |
0707.1099 | 1670687021 | We are concerned with the problem of maximizing the worst-case lifetime of a data-gathering wireless sensor network consisting of a set of sensor nodes directly communicating with a base-station.We propose to solve this problem by modeling sensor node and base-station communication as the interactive communication betw... | The multiple correlated informants - single recipient'' communication problem we are considering in this paper, is basically well-known distributed source coding (DSC) problem. This problem was first considered by Slepian and Wolf @cite_11 for lossless compression of discrete random variables and by Wyner and Ziv @cite... | {
"cite_N": [
"@cite_24",
"@cite_11"
],
"mid": [
"2150412388",
"2142521365"
],
"abstract": [
"Let (X_ k , Y_ k ) ^ _ k=1 be a sequence of independent drawings of a pair of dependent random variables X, Y . Let us say that X takes values in the finite set X . It is desired to encode the seq... |
0707.1099 | 1670687021 | We are concerned with the problem of maximizing the worst-case lifetime of a data-gathering wireless sensor network consisting of a set of sensor nodes directly communicating with a base-station.We propose to solve this problem by modeling sensor node and base-station communication as the interactive communication betw... | One of the essential characteristic of the standard DSC problem is that the information sources, also called encoders or informants, are not allowed to interact or cooperate with each other, for the purpose of compressing their information. There are two approaches to solve the DSC problem. First, allow the data-gather... | {
"cite_N": [
"@cite_13",
"@cite_18",
"@cite_7",
"@cite_9",
"@cite_17",
"@cite_0",
"@cite_2",
"@cite_15",
"@cite_10",
"@cite_12",
"@cite_11"
],
"mid": [
"2108719798",
"",
"",
"2080257599",
"",
"2138256990",
"",
"",
"",
"2162404506... |
0707.1099 | 1670687021 | We are concerned with the problem of maximizing the worst-case lifetime of a data-gathering wireless sensor network consisting of a set of sensor nodes directly communicating with a base-station.We propose to solve this problem by modeling sensor node and base-station communication as the interactive communication betw... | In @cite_13 , only the scenario in which two correlated informants communicate with a recipient is considered. It assumed that both the informants and recipient know the joint distribution of informants' data. Also, only the average of total number of bits exchanged is minimized. In @cite_25 , only two messages are all... | {
"cite_N": [
"@cite_13",
"@cite_25"
],
"mid": [
"2108719798",
"2050344210"
],
"abstract": [
"X and Y are random variables. Person P sub x knows X, Person P sub y knows Y, and both know the joint probability distribution of the pair (X,Y). Using a predetermined protocol, they communicate o... |
0707.1099 | 1670687021 | We are concerned with the problem of maximizing the worst-case lifetime of a data-gathering wireless sensor network consisting of a set of sensor nodes directly communicating with a base-station.We propose to solve this problem by modeling sensor node and base-station communication as the interactive communication betw... | A preliminary version of our ideas appears in @cite_22 , where we also extend the notions of and , proposed in @cite_19 and derive some of their properties. We intend to address the average-case communication problem and some other variations of the problem considered here, in future. | {
"cite_N": [
"@cite_19",
"@cite_22"
],
"mid": [
"2138185924",
"2000703219"
],
"abstract": [
"The reduction in communication achievable by interaction is investigated. The model assumes two communicators: an informant having a random variable X, and a recipient having a possibly dependent ... |
0707.1548 | 2951394397 | Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these struc... | Let @math and @math be two sets of materialized views and indexes, respectively, that are termed candidate and are susceptible to reduce the execution cost of a given query set @math (generally supposed representative of system workload). Let @math . Let @math be the storage space allotted by the data warehouse adminis... | {
"cite_N": [
"@cite_17",
"@cite_56"
],
"mid": [
"1607470293",
"2049859567"
],
"abstract": [
"A data warehouse is a repository (database) that integrates information extracted from various remote sources, with the purpose of efficiently supporting decision support queries. The information ... |
0707.1548 | 2951394397 | Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these struc... | Classical papers in materialized view selection introduce a lattice framework that models and captures dependency (ancestor or descendent) among aggregate views in a multidimensional context @cite_34 @cite_23 @cite_0 @cite_37 . This lattice is greedily browsed with the help of cost models to select the best views to ma... | {
"cite_N": [
"@cite_37",
"@cite_8",
"@cite_36",
"@cite_9",
"@cite_39",
"@cite_0",
"@cite_57",
"@cite_23",
"@cite_34"
],
"mid": [
"2071288167",
"",
"2016826240",
"2132681112",
"2017782374",
"2164049396",
"2061660313",
"1538267625",
""
],
... |
0707.1548 | 2951394397 | Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these struc... | A wavelet framework for adaptively representing multidimensional data cubes has also been proposed @cite_40 . This method decomposes data cubes into an indexed hierarchy of wavelet view elements that correspond to partial and residual aggregations of data cubes. An algorithm greedily selects a non-expensive set of wave... | {
"cite_N": [
"@cite_40"
],
"mid": [
"2158924892"
],
"abstract": [
"This article presents a method for adaptively representing multidimensional data cubes using wavelet view elements in order to more efficiently support data analysis and querying involving aggregations. The proposed method decompo... |
0707.1548 | 2951394397 | Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these struc... | Other approaches detect common sub-expressions within workload queries in the relational context @cite_22 @cite_11 @cite_48 . The view selection problem then consists in finding common subexpressions corresponding to intermediary results that are suitable to materialize. However, browsing is very costly and these metho... | {
"cite_N": [
"@cite_48",
"@cite_22",
"@cite_11"
],
"mid": [
"1496130826",
"2171492933",
"1597931764"
],
"abstract": [
"View materialization and indexing are the most effective techniques adopted in data warehouses to improve query performance. Since both materialization and indexi... |
0707.1548 | 2951394397 | Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these struc... | Finally, the most recent approaches are workload-driven. They syntactically analyze a workload to enumerate relevant candidate views @cite_43 . By exploiting the system's query optimizer, they greedily build a configuration of the most pertinent views. A workload is indeed a good starting point to predict future querie... | {
"cite_N": [
"@cite_43"
],
"mid": [
"2122816893"
],
"abstract": [
"Automatically selecting an appropriate set of materialized views and indexes for SQL databases is a non-trivial task. A judicious choice must be cost-driven and influenced by the workload experienced by the system. Although there ... |
0707.1548 | 2951394397 | Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these struc... | The index selection problem has been studied for many years in databases @cite_53 @cite_49 @cite_43 @cite_1 @cite_50 @cite_45 @cite_58 . In the more specific context of data warehouses, existing research studies may be clustered into two families: algorithms that optimize maintenance cost @cite_6 and algorithms that op... | {
"cite_N": [
"@cite_18",
"@cite_33",
"@cite_53",
"@cite_1",
"@cite_6",
"@cite_24",
"@cite_43",
"@cite_45",
"@cite_50",
"@cite_49",
"@cite_58"
],
"mid": [
"2139086573",
"",
"2047085757",
"2168503413",
"2132729409",
"2113888164",
"2122816893",... |
0707.1548 | 2951394397 | Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these struc... | Selecting a set of candidate indexes may be automatic or manual. Warehouse administrators may indeed appeal to their expertise and manually provide, from a given workload, a set of candidate indexes @cite_49 @cite_32 @cite_29 . Such a choice is however subjective. Moreover, the task may be very hard to achieve when the... | {
"cite_N": [
"@cite_14",
"@cite_33",
"@cite_29",
"@cite_1",
"@cite_32",
"@cite_49"
],
"mid": [
"1851390469",
"",
"2116456505",
"2168503413",
"",
"1562318351"
],
"abstract": [
"In this paper we describe novel techniques that make it possible to build an indu... |
0707.1548 | 2951394397 | Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these struc... | Ascending greedy methods start from an empty set of candidate indexes @cite_20 @cite_49 @cite_29 @cite_14 . They incrementally add in indexes minimizing cost. This process stops when cost ceases decreasing. Contrarily, descending greedy methods consider the whole set of candidate indexes as a starting point. Then, at e... | {
"cite_N": [
"@cite_14",
"@cite_29",
"@cite_32",
"@cite_49",
"@cite_20"
],
"mid": [
"1851390469",
"2116456505",
"",
"1562318351",
"2102099561"
],
"abstract": [
"In this paper we describe novel techniques that make it possible to build an industrial-strength tool fo... |
0707.1548 | 2951394397 | Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these struc... | Genetic algorithms are commonly used to resolve optimization problems. They have been adapted to the index selection problem @cite_45 . The initial population is a set of input indexes (an index is assimilated to an individual). The objective function to optimize is the workload cost corresponding to an index configura... | {
"cite_N": [
"@cite_21",
"@cite_1",
"@cite_44",
"@cite_45",
"@cite_50"
],
"mid": [
"2059326501",
"2168503413",
"2078524330",
"1590637314",
"2135475686"
],
"abstract": [
"Abstract Index selection for relational databases is an important issue which has been research... |
0707.1548 | 2951394397 | Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these struc... | Another approach determines a trade-off between storage space allotted to indexes and materialized views, depending on query definition @cite_48 . According to the authors, the key factors to leverage query optimization is aggregation level, defined by the attribute list of Group by clauses in SQL queries, and the sele... | {
"cite_N": [
"@cite_48"
],
"mid": [
"1496130826"
],
"abstract": [
"View materialization and indexing are the most effective techniques adopted in data warehouses to improve query performance. Since both materialization and indexing algorithms are driven by a constraint on the disk space made avai... |
0707.1913 | 2951035381 | Collaborative work on unstructured or semi-structured documents, such as in literature corpora or source code, often involves agreed upon templates containing metadata. These templates are not consistent across users and over time. Rule-based parsing of these templates is expensive to maintain and tends to fail as new ... | The algorithmics of finding frequent items or patterns has received much attention. For a survey of the stream-based algorithms, see Cormode and Muthukrishnan [p. 253] corm:whats-hot . Finding frequent patterns robustly is possible using gap constraints @cite_29 . | {
"cite_N": [
"@cite_29"
],
"mid": [
"2150045644"
],
"abstract": [
"Discovering contrasts between collections of data is an important task in data mining. In this paper, we introduce a new type of contrast pattern, called a minimal distinguishing subsequence (MDS). An MDS is a minimal subsequence ... |
0707.1954 | 1483340443 | Wireless sensor networks are often used for environmental monitoring applications. In this context sampling and reconstruction of a physical field is one of the most important problems to solve. We focus on a bandlimited field and find under which conditions on the network topology the reconstruction of the field is su... | Few papers have addressed the problem of sampling and reconstruction in sensor networks. Efficient techniques for spatial sampling in sensor networks are proposed in @cite_2 @cite_4 . In particular @cite_2 presents an algorithm to determine which sensor subsets should be selected to acquire data from an area of interes... | {
"cite_N": [
"@cite_10",
"@cite_4",
"@cite_3",
"@cite_2"
],
"mid": [
"1597674521",
"2149119325",
"2165221495",
""
],
"abstract": [
"We address the problem of deterministic oversampling of bandlimited sensor fields in a distributed communication-constrained processing envir... |
0707.1954 | 1483340443 | Wireless sensor networks are often used for environmental monitoring applications. In this context sampling and reconstruction of a physical field is one of the most important problems to solve. We focus on a bandlimited field and find under which conditions on the network topology the reconstruction of the field is su... | Note that our work significantly differs from the studies above because we assume that the sensors location are known (or can be determined @cite_11 @cite_6 @cite_0 ) and the sensor precision is sufficiently high so that the quantization error is negligible. The question we pose is instead under which conditions (on th... | {
"cite_N": [
"@cite_0",
"@cite_6",
"@cite_11"
],
"mid": [
"2161249924",
"2131152141",
""
],
"abstract": [
"This paper describes a distributed, linear-time algorithm for localizing sensor network nodes in the presence of range measurement noise and demonstrates the algorithm on a p... |
1211.5183 | 2952217788 | As the Internet struggles to cope with scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern systems and applications. In particular, Content-Oriented Networking (CON) has emerged as a promising next-generation Internet architecture: it sets t... | Propelled by the increasing interest for next-generation Internet architectures and, in particular, Content-Oriented Networking (CON), the research community has produced a large body of work dealing with CON building blocks @cite_27 @cite_3 @cite_33 @cite_44 @cite_24 , performance @cite_78 @cite_49 @cite_72 @cite_82 ,... | {
"cite_N": [
"@cite_14",
"@cite_33",
"@cite_78",
"@cite_3",
"@cite_44",
"@cite_24",
"@cite_27",
"@cite_72",
"@cite_45",
"@cite_49",
"@cite_82"
],
"mid": [
"1985355206",
"",
"2044185680",
"2168903090",
"",
"1668625574",
"2014952121",
"208... |
1211.5183 | 2952217788 | As the Internet struggles to cope with scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern systems and applications. In particular, Content-Oriented Networking (CON) has emerged as a promising next-generation Internet architecture: it sets t... | Security in CON. Wong and Nikander @cite_25 address security of naming mechanisms by constructing content name as the concatenation of content provider's ID, cryptographic ID of the content and some meta-data. @cite_5 adopt a similar approach where content name is defined as the concatenation of the hash of the public ... | {
"cite_N": [
"@cite_35",
"@cite_27",
"@cite_5",
"@cite_31",
"@cite_76",
"@cite_25"
],
"mid": [
"2952176031",
"2014952121",
"2092433893",
"2018793106",
"",
""
],
"abstract": [
"Instrumented environments, such as modern building automation systems (BAS), are ... |
1211.5183 | 2952217788 | As the Internet struggles to cope with scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern systems and applications. In particular, Content-Oriented Networking (CON) has emerged as a promising next-generation Internet architecture: it sets t... | Privacy Issues in CON. To the best of our knowledge, the only related privacy study is the recent article by in @cite_48 @cite_37 , that covers security and privacy issues of CCN @cite_27 . Specifically, they highlight a few Denial-of-Service (DoS) vulnerabilities as well as different cache-related attacks. In CCN, a p... | {
"cite_N": [
"@cite_48",
"@cite_37",
"@cite_27"
],
"mid": [
"2900033313",
"2071740737",
"2014952121"
],
"abstract": [
"",
"Named Data Networking architectures have been proposed to improve various shortcomings of the current Internet architecture. A key part of these proposals... |
1211.5183 | 2952217788 | As the Internet struggles to cope with scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern systems and applications. In particular, Content-Oriented Networking (CON) has emerged as a promising next-generation Internet architecture: it sets t... | From the privacy perspective, work in @cite_48 @cite_37 identifies the issue of information leakage through caches in CCN. It proposes a few simple countermeasures, following and approaches. The former can be achieved using techniques similar to those addressing cache pollution attacks in IP @cite_53 , although such an... | {
"cite_N": [
"@cite_48",
"@cite_37",
"@cite_53"
],
"mid": [
"2900033313",
"2071740737",
"2070364554"
],
"abstract": [
"",
"Named Data Networking architectures have been proposed to improve various shortcomings of the current Internet architecture. A key part of these proposals... |
1211.5183 | 2952217788 | As the Internet struggles to cope with scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern systems and applications. In particular, Content-Oriented Networking (CON) has emerged as a promising next-generation Internet architecture: it sets t... | Our work extends that in @cite_48 @cite_37 by encompassing all privacy aspects: caching, naming, signature, and content. Also, it is more general as it does not only consider CCN @cite_27 , but CON in general, independently of the specific instantiation. Furthermore, when suggesting countermeasures, we only propose tec... | {
"cite_N": [
"@cite_48",
"@cite_37",
"@cite_27"
],
"mid": [
"2900033313",
"2071740737",
"2014952121"
],
"abstract": [
"",
"Named Data Networking architectures have been proposed to improve various shortcomings of the current Internet architecture. A key part of these proposals... |
1211.5183 | 2952217788 | As the Internet struggles to cope with scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern systems and applications. In particular, Content-Oriented Networking (CON) has emerged as a promising next-generation Internet architecture: it sets t... | Anonymity in CON. AND @math NA @cite_30 proposes a Tor-like anonymizing tool for CCN @cite_27 to provide provable anonymity. It also aims to privacy protection via simple tunneling. However, as discussed in , AND @math NA is an all-in-one'' solution that introduces latency and impedes caching. Whereas, fine-grained pri... | {
"cite_N": [
"@cite_30",
"@cite_27",
"@cite_57"
],
"mid": [
"2962973644",
"2014952121",
"2091803449"
],
"abstract": [
"Content-centric networking — also known as information-centric networking (ICN) — shifts emphasis from hosts and interfaces (as in today’s Internet) to data. Name... |
1211.5263 | 2128011898 | A smooth affine hypersurface Z of complex dimension n is homotopy equivalent to an n-dimensional cell complex. Given a defining polynomial f for Z as well as a regular triangulation of its Newton polytope, we provide a purely combinatorial construction of a compact topological space S as a union of components of real d... | A skeleton for Fermat hypersurfaces was described by Deligne in [pp. 88--90] Deligne , and this skeleton is visible in our own in a manner described in Remark . Our skeleta'' are different than the skeleta'' that appear in nonarchimedean geometry @cite_10 @cite_15 , but @math plays a similar role in both constructions.... | {
"cite_N": [
"@cite_15",
"@cite_10"
],
"mid": [
"2154785235",
"1974286590"
],
"abstract": [
"In this paper we propose a way to construct an analytic space over a non-archimedean field, starting with a real manifold with an affine structure which has integral monodromy. Our construction is... |
1211.5263 | 2128011898 | A smooth affine hypersurface Z of complex dimension n is homotopy equivalent to an n-dimensional cell complex. Given a defining polynomial f for Z as well as a regular triangulation of its Newton polytope, we provide a purely combinatorial construction of a compact topological space S as a union of components of real d... | Hypersurfaces in algebraic tori have been studied by Danilov-Khovanski @cite_14 and Batyrev @cite_19 . Danilov-Khovankski computed mixed Hodge numbers, while Batyev studied the variation of mixed Hodge structures. Log geometry has been extensively employed by Gross and Siebert @cite_21 in their seminal work studying th... | {
"cite_N": [
"@cite_14",
"@cite_4",
"@cite_21",
"@cite_0",
"@cite_19",
"@cite_16"
],
"mid": [
"2089077804",
"2951039910",
"2152197792",
"170447308",
"1598088461",
"1794065146"
],
"abstract": [
"An algorithm is given for computing the mixed Hodge structure (... |
1211.5263 | 2128011898 | A smooth affine hypersurface Z of complex dimension n is homotopy equivalent to an n-dimensional cell complex. Given a defining polynomial f for Z as well as a regular triangulation of its Newton polytope, we provide a purely combinatorial construction of a compact topological space S as a union of components of real d... | In the symplectic-topological setting, Mikhalkin @cite_5 constructed a degeneration of a projective algebraic hypersurface using a triangulation of its Newton polytope to provide a higher-dimensional pair-of-pants'' decomposition. He further identified a stratified torus fibration over the spine of the corresponding am... | {
"cite_N": [
"@cite_5",
"@cite_11"
],
"mid": [
"2056254807",
"2135572587"
],
"abstract": [
"Abstract It is well-known that a Riemann surface can be decomposed into the so-called pairs-of-pants . Each pair-of-pants is diffeomorphic to a Riemann sphere minus 3 points. We show that a smooth ... |
1211.5184 | 2951471647 | Many online social networks feature restrictive web interfaces which only allow the query of a user's local neighborhood through the interface. To enable analytics over such an online social network through its restrictive web interface, many recent efforts reuse the existing Markov Chain Monte Carlo methods such as ra... | With global topology, @cite_12 discussed sampling techniques like random node, random edge, random subgraph in large graphs. @cite_22 introduced Albatross sampling which combines random jump and MHRW. @cite_26 also demonstrated true uniform sampling method among the users' id as ground-truth". | {
"cite_N": [
"@cite_26",
"@cite_22",
"@cite_12"
],
"mid": [
"2137135938",
"",
"2146008005"
],
"abstract": [
"With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (... |
1211.5184 | 2951471647 | Many online social networks feature restrictive web interfaces which only allow the query of a user's local neighborhood through the interface. To enable analytics over such an online social network through its restrictive web interface, many recent efforts reuse the existing Markov Chain Monte Carlo methods such as ra... | @cite_21 found that the mixing time of typical online social networks is much larger than anticipated, which validates our motivation to shorten the mixing time of random walk. @cite_13 derived the fastest mixing random walk on a graph by convex optimization on second largest eigenvalue of the transition matrix, but it... | {
"cite_N": [
"@cite_21",
"@cite_13"
],
"mid": [
"2127503167",
"2134711723"
],
"abstract": [
"Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networks are fast mixin... |
1211.5184 | 2951471647 | Many online social networks feature restrictive web interfaces which only allow the query of a user's local neighborhood through the interface. To enable analytics over such an online social network through its restrictive web interface, many recent efforts reuse the existing Markov Chain Monte Carlo methods such as ra... | @cite_6 compared latent space model with real social network data. @cite_14 introduced hybrid graph model to incorporate the small world phenomenon. @cite_7 also measured the difference between multiple synthetic graphs and real world social network graphs. | {
"cite_N": [
"@cite_14",
"@cite_7",
"@cite_6"
],
"mid": [
"2123718282",
"2070265204",
"2416287443"
],
"abstract": [
"The small world phenomenon, that consistently occurs in numerous exist- ing networks, refers to two similar but different properties — small average distance and th... |
1211.5608 | 2952304478 | We consider the problem of recovering two unknown vectors, @math and @math , of length @math from their circular convolution. We make the structural assumption that the two vectors are members of known subspaces, one with dimension @math and the other with dimension @math . Although the observed convolution is nonlinea... | While this paper is only concerned with recovery by nuclear norm minimization, other types of recovery techniques have proven effective both in theory and in practice; see for example @cite_4 @cite_12 @cite_14 . It is possible that the guarantees given in this paper could be extended to these other algorithms. | {
"cite_N": [
"@cite_14",
"@cite_4",
"@cite_12"
],
"mid": [
"2158923808",
"2144730813",
"2962769133"
],
"abstract": [
"In this paper, we address compressed sensing of a low-rank matrix posing the inverse problem as an approximation problem with a specified target rank of the soluti... |
1211.5608 | 2952304478 | We consider the problem of recovering two unknown vectors, @math and @math , of length @math from their circular convolution. We make the structural assumption that the two vectors are members of known subspaces, one with dimension @math and the other with dimension @math . Although the observed convolution is nonlinea... | As we will see below, our mathematical analysis has mostly to do how matrices of the form in act on rank-2 matrices in a certain subspace. Matrices of this type have been considered in the context of sparse recovery in the compressed sensing literature for applications including multiple-input multiple-output channel e... | {
"cite_N": [
"@cite_13",
"@cite_37",
"@cite_18"
],
"mid": [
"2109855984",
"",
"2143884558"
],
"abstract": [
"The recently developed compressive sensing (CS) framework enables the design of sub-Nyquist analog-to-digital converters. Several architectures have been proposed for the a... |
1502.00842 | 1560878967 | We introduce a new family of erasure codes, called group decodable code (GDC), for distributed storage system. Given a set of design parameters ; ; k; t , where k is the number of information symbols, each codeword of an ( ; ; k; t)-group decodable code is a t-tuple of strings, called buckets, such that each bucket is ... | In @cite_12 , the concept of @math -locality was defined, which captures the property that there exist @math pairwise disjoint local repair sets for a code symbol. An upper bound on the minimum distance for @math linear codes with information @math -locality was derived, and codes that attain this bound was constructed... | {
"cite_N": [
"@cite_13",
"@cite_12"
],
"mid": [
"2963120590",
"2018102393"
],
"abstract": [
"A locally recoverable code (LRC code) is a code over a finite alphabet such that every symbol in the encoding is a function of a small number of other symbols that form a recovering set. Bounds on... |
1502.00739 | 2038147967 | This paper aims at developing an integrated system of clothing co-parsing, in order to jointly parse a set of clothing images (unsegmented but annotated with tags) into semantic configurations. We propose a data-driven framework consisting of two phases of inference. The first phase, referred as "image co-segmentation"... | In literature, existing efforts on clothing human segmentation and recognition mainly focused on constructing expressive models to address various clothing styles and appearances @cite_0 @cite_1 @cite_14 @cite_34 @cite_32 @cite_3 @cite_19 . One classic work @cite_0 proposed a composite And-Or graph template for modelin... | {
"cite_N": [
"@cite_14",
"@cite_22",
"@cite_29",
"@cite_9",
"@cite_1",
"@cite_32",
"@cite_3",
"@cite_16",
"@cite_0",
"@cite_19",
"@cite_34"
],
"mid": [
"",
"2074621908",
"2094311777",
"2045570199",
"",
"",
"",
"1998827347",
"21088905... |
1502.00739 | 2038147967 | This paper aims at developing an integrated system of clothing co-parsing, in order to jointly parse a set of clothing images (unsegmented but annotated with tags) into semantic configurations. We propose a data-driven framework consisting of two phases of inference. The first phase, referred as "image co-segmentation"... | Clothing co-parsing is also highly related to image object co-labeling, where a batch of input images containing similar objects are processed jointly @cite_5 @cite_21 @cite_27 . For example, unsupervised shape guided approaches were adopted in @cite_13 to achieve single object category co-labeling. Winn et. al. @cite_... | {
"cite_N": [
"@cite_21",
"@cite_24",
"@cite_27",
"@cite_5",
"@cite_13",
"@cite_25"
],
"mid": [
"2079980910",
"2141303268",
"2171323859",
"2146387413",
"2164877691",
"2158305599"
],
"abstract": [
"This paper presents a framework for semantically segmenting a... |
1502.00749 | 2083858539 | This article investigates a data-driven approach for semantic scene understanding, without pixelwise annotation or classifier training. The proposed framework parses a target image in two steps: first, retrieving its exemplars (that is, references) from an image database, where all images are unsegmented but annotated ... | Traditional efforts for scene understanding mainly focused on capturing scene appearances, structures and spatial contexts by developing combinatorial models, e.g., CRF @cite_9 @cite_17 , Texton-Forest @cite_0 , Graph Grammar @cite_4 . These models were generally founded on supervised learning techniques, and required ... | {
"cite_N": [
"@cite_0",
"@cite_9",
"@cite_4",
"@cite_17"
],
"mid": [
"2100588357",
"1528789833",
"1993164181",
""
],
"abstract": [
"We propose semantic texton forests, efficient and powerful new low-level features. These are ensembles of decision trees that act directly on... |
1502.00749 | 2083858539 | This article investigates a data-driven approach for semantic scene understanding, without pixelwise annotation or classifier training. The proposed framework parses a target image in two steps: first, retrieving its exemplars (that is, references) from an image database, where all images are unsegmented but annotated ... | Several weakly supervised methods are proposed to indicate the classes presented in the images with only image-level labels. For example, @cite_16 proposed to learn object classes based on unsupervised image segmentation. @cite_8 learned classification models for all scene labels by selecting representative training sa... | {
"cite_N": [
"@cite_16",
"@cite_6",
"@cite_7",
"@cite_8"
],
"mid": [
"2134529554",
"2125849446",
"2158427031",
"2215086518"
],
"abstract": [
"We address the problem of learning object class models and object segmentations from unannotated images. We introduce LOCUS (learni... |
1502.00743 | 2950368212 | This paper investigates how to extract objects-of-interest without relying on hand-craft features and sliding windows approaches, that aims to jointly solve two sub-tasks: (i) rapidly localizing salient objects from images, and (ii) accurately segmenting the objects based on the localizations. We present a general join... | Extracting pixelwise objects-of-interest from an image, our work is related to the salient region object detections @cite_34 @cite_19 @cite_0 @cite_26 . These methods mainly focused on feature engineering and graph-based segmentation. For example, @cite_19 proposed a regional contrast based saliency extraction algorith... | {
"cite_N": [
"@cite_26",
"@cite_14",
"@cite_9",
"@cite_29",
"@cite_0",
"@cite_19",
"@cite_23",
"@cite_34"
],
"mid": [
"2002781701",
"2091124216",
"2060475276",
"2002754212",
"2156777442",
"2037954058",
"",
"1982075130"
],
"abstract": [
"When... |
1502.00743 | 2950368212 | This paper investigates how to extract objects-of-interest without relying on hand-craft features and sliding windows approaches, that aims to jointly solve two sub-tasks: (i) rapidly localizing salient objects from images, and (ii) accurately segmenting the objects based on the localizations. We present a general join... | Recently resurgent deep learning methods have also been applied in object detection and image segmentation @cite_30 @cite_25 @cite_15 @cite_13 @cite_18 @cite_3 @cite_27 @cite_2 . Among these works, @cite_8 detected objects by training category-level convolutional neural networks. @cite_2 proposed to combine multiple co... | {
"cite_N": [
"@cite_30",
"@cite_18",
"@cite_8",
"@cite_10",
"@cite_3",
"@cite_27",
"@cite_2",
"@cite_15",
"@cite_13",
"@cite_25"
],
"mid": [
"2130306094",
"",
"1487583988",
"2949150497",
"33116912",
"",
"2156547346",
"",
"2153378748",
... |
1502.00702 | 2169585179 | In this paper, we propose a novel model for high-dimensional data, called the Hybrid Orthogonal Projection and Estimation (HOPE) model, which combines a linear orthogonal projection and a finite mixture model under a unified generative modeling framework. The HOPE model itself can be learned unsupervised from unlabelle... | Similar to PCA, the Fisher's linear discriminant analysis (LDA) can also be viewed as a linear dimensionality reduction technique. However, PCA is unsupervised in the sense that PCA depends only on the data while Fisher's LDA is supervised since it uses both data and class-label information. The high-dimensional data a... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2080400971"
],
"abstract": [
"We present the theory for heteroscedastic discriminant analysis (HDA), a model-based generalization of linear discriminant analysis (LDA) derived in the maximum-likelihood framework to handle heteroscedastic-unequal variance-classi... |
1904.12164 | 2941755003 | The problem of influence maximization is to select the most influential individuals in a social network. With the popularity of social network sites, and the development of viral marketing, the importance of the problem has been increased. The influence maximization problem is NP-hard, and therefore, there will not exi... | In order to improve the efficiency of the computations, many studies have been made. Leskovec al @cite_3 proposed Cost-Effective Lazy Forward (CELF) optimization that reduces the computation cost of the influence spread using sub-modularity property of the objective function. | {
"cite_N": [
"@cite_3"
],
"mid": [
"2141403143"
],
"abstract": [
"Given a water distribution network, where should we place sensors toquickly detect contaminants? Or, which blogs should we read to avoid missing important stories?. These seemingly different problems share common structure: Outbrea... |
1904.12164 | 2941755003 | The problem of influence maximization is to select the most influential individuals in a social network. With the popularity of social network sites, and the development of viral marketing, the importance of the problem has been increased. The influence maximization problem is NP-hard, and therefore, there will not exi... | Chen al @cite_8 proposed new greedy algorithms for independent cascade and weighted cascade models. They made the greedy algorithm faster by combining their algorithms with CELF. They also proposed a new heuristic, named , which produces results of quality close to the greedy algorithm, while is much faster than that a... | {
"cite_N": [
"@cite_14",
"@cite_8",
"@cite_1",
"@cite_6",
"@cite_15",
"@cite_16",
"@cite_11"
],
"mid": [
"2132801025",
"2108858998",
"2615460211",
"2552732996",
"2035165116",
"2963122331",
"2730107189"
],
"abstract": [
"Given a social network G and ... |
1904.12164 | 2941755003 | The problem of influence maximization is to select the most influential individuals in a social network. With the popularity of social network sites, and the development of viral marketing, the importance of the problem has been increased. The influence maximization problem is NP-hard, and therefore, there will not exi... | There are some community-based algorithms for the influence maximization problem that partition the graph into small subgraphs and select the most influential vertices from each subgraph. Chen al @cite_2 used H-Clustering algorithm and Manaskasemsak al @cite_13 used Markov clustering algorithm for community detection. ... | {
"cite_N": [
"@cite_13",
"@cite_12",
"@cite_2"
],
"mid": [
"2463275665",
"1981141219",
"2106597862"
],
"abstract": [
"Online social network today is an effective media to share and disperse tons of information, especially for advertizing and marketing. However, with limited budget... |
1904.12191 | 2941057241 | We consider the problem of learning an unknown function @math on the @math -dimensional sphere with respect to the square loss, given i.i.d. samples @math where @math is a feature vector uniformly distributed on the sphere and @math . We study two popular classes of models that can be regarded as linearizations of two-... | Approximation properties of neural networks and, more generally, nonlinear approximation have been studied in detail in the nineties, see e.g. @cite_17 @cite_2 @cite_4 . The main concern of the present paper is quite different, since we focus on the random feature model, and the (recently proposed) neural tangent model... | {
"cite_N": [
"@cite_2",
"@cite_4",
"@cite_17"
],
"mid": [
"1981025032",
"2079224763",
"1990261069"
],
"abstract": [
"We had previously shown that regularization principles lead to approximation schemes that are equivalent to networks with one layer of hidden units, called regulari... |
1904.12191 | 2941057241 | We consider the problem of learning an unknown function @math on the @math -dimensional sphere with respect to the square loss, given i.i.d. samples @math where @math is a feature vector uniformly distributed on the sphere and @math . We study two popular classes of models that can be regarded as linearizations of two-... | The random features model , has been studied in considerable depth since the original work in @cite_21 . The classical viewpoint suggests that @math should be regarded as an approximation of the reproducing kernel Hilbert space (RKHS) @math defined by the kernel (see @cite_13 for general background) Indeed the space @m... | {
"cite_N": [
"@cite_18",
"@cite_26",
"@cite_21",
"@cite_23",
"@cite_13",
"@cite_11"
],
"mid": [
"2963709899",
"2963942108",
"",
"2963013450",
"1565176583",
"2185932763"
],
"abstract": [
"We show that kernel-based quadrature rules for computing integrals can... |
1904.12191 | 2941057241 | We consider the problem of learning an unknown function @math on the @math -dimensional sphere with respect to the square loss, given i.i.d. samples @math where @math is a feature vector uniformly distributed on the sphere and @math . We study two popular classes of models that can be regarded as linearizations of two-... | Of course, this approach generally breaks down if the dimension @math is large (technically, if it grows with @math ). This curse of dimensionality' is already revealed by classical lower bounds in functional approximation, see e.g. @cite_17 @cite_18 . However, previous work does not clarify what happens precisely in t... | {
"cite_N": [
"@cite_18",
"@cite_17"
],
"mid": [
"2963709899",
"1990261069"
],
"abstract": [
"We show that kernel-based quadrature rules for computing integrals can be seen as a special case of random feature expansions for positive definite kernels, for a particular decomposition that alw... |
1904.12191 | 2941057241 | We consider the problem of learning an unknown function @math on the @math -dimensional sphere with respect to the square loss, given i.i.d. samples @math where @math is a feature vector uniformly distributed on the sphere and @math . We study two popular classes of models that can be regarded as linearizations of two-... | The connection between kernel methods and neural networks was recently revived by the work of Belkin and coauthors @cite_12 @cite_24 who pointed out intriguing similarities between some properties of modern deep learning models, and large scale kernel learning. A concrete explanation for this analogy was proposed in @c... | {
"cite_N": [
"@cite_7",
"@cite_28",
"@cite_29",
"@cite_24",
"@cite_27",
"@cite_5",
"@cite_15",
"@cite_12"
],
"mid": [
"2912322140",
"",
"2899748887",
"2810365967",
"2894604724",
"2900959181",
"2899790086",
"2787348029"
],
"abstract": [
"A lo... |
1904.12191 | 2941057241 | We consider the problem of learning an unknown function @math on the @math -dimensional sphere with respect to the square loss, given i.i.d. samples @math where @math is a feature vector uniformly distributed on the sphere and @math . We study two popular classes of models that can be regarded as linearizations of two-... | It is worth mentioning that an alternative approach to the analysis of two-layers neural networks, in the limit of a large number of neurons, was developed in @cite_19 @cite_14 @cite_20 @cite_22 @cite_9 . Unlike in the neural tangent approach, the evolution of network weights is described beyond the linear regime in th... | {
"cite_N": [
"@cite_14",
"@cite_22",
"@cite_9",
"@cite_19",
"@cite_20"
],
"mid": [
"2798986185",
"",
"2913010492",
"2963095610",
"2798826368"
],
"abstract": [
"Neural networks, a central tool in machine learning, have demonstrated remarkable, high fidelity performa... |
1904.11968 | 2942322914 | The abundance of open-source code, coupled with the success of recent advances in deep learning for natural language processing, has given rise to a promising new application of machine learning to source code. In this work, we explore the use of a Siamese recurrent neural network model on Python source code to create ... | introduce CODEnn @cite_7 , which creates vector representations of Java source code by jointly embedding code with a natural language description of the method. Their architecture uses recurrent neural networks (RNN) on sequences of API calls and on tokens from the method name. It then fuses this with the output of a m... | {
"cite_N": [
"@cite_7"
],
"mid": [
"2794601162"
],
"abstract": [
"To implement a program functionality, developers can reuse previously written code snippets by searching through a large-scale codebase. Over the years, many code search tools have been proposed to help developers. The existing app... |
1904.11968 | 2942322914 | The abundance of open-source code, coupled with the success of recent advances in deep learning for natural language processing, has given rise to a promising new application of machine learning to source code. In this work, we explore the use of a Siamese recurrent neural network model on Python source code to create ... | @cite_0 convert the AST into a binary tree and then use an autoencoder to learn an embedding model for each node. This learned embedding model is applied recursively to the tree to obtain a final embedding for the root node. The model is an autoencoder, and as such, may fail to recognize the semantic equivalency betwee... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2511803001"
],
"abstract": [
"Code clone detection is an important problem for software maintenance and evolution. Many approaches consider either structure or identifiers, but none of the existing detection techniques model both sources of information. These t... |
1904.11968 | 2942322914 | The abundance of open-source code, coupled with the success of recent advances in deep learning for natural language processing, has given rise to a promising new application of machine learning to source code. In this work, we explore the use of a Siamese recurrent neural network model on Python source code to create ... | The work of @cite_4 encodes nodes of an AST using a weighted mixture of left and right weight matrices and children of that node. A tree-based convolutional neural network (CNN) is then applied against the tree to encode the AST. The only way semantic equivalents are learned in this model are by recognizing that certai... | {
"cite_N": [
"@cite_4"
],
"mid": [
"1512847993"
],
"abstract": [
"Deep neural networks have made significant breakthroughs in many fields of artificial intelligence. However, it has not been applied in the field of programming language processing. In this paper, we propose the tree-based convolut... |
1904.11968 | 2942322914 | The abundance of open-source code, coupled with the success of recent advances in deep learning for natural language processing, has given rise to a promising new application of machine learning to source code. In this work, we explore the use of a Siamese recurrent neural network model on Python source code to create ... | @cite_1 used a long-short term memory (LSTM) cell in a tree structure applied to an AST to classify defects. The model is trained in an unsupervised manner to predict a node from its children. @cite_13 learn code vector embeddings by evaluating paths in the AST and evaluate the resulting vectors by predicting method na... | {
"cite_N": [
"@cite_13",
"@cite_15",
"@cite_1"
],
"mid": [
"2964150020",
"2807866521",
"2786676889"
],
"abstract": [
"We present a neural model for representing snippets of code as continuous distributed vectors ( code embeddings''). The main idea is to represent a code snippet as... |
1904.11968 | 2942322914 | The abundance of open-source code, coupled with the success of recent advances in deep learning for natural language processing, has given rise to a promising new application of machine learning to source code. In this work, we explore the use of a Siamese recurrent neural network model on Python source code to create ... | In Deep Code Comment Generation @cite_11 , introduce structure-based traversals of an AST to feed into a sequence to sequence architecture, and train the model to translate source code into comments. Then the trained model is used to generate comments on new source code. The encoded vectors are designed to initialize a... | {
"cite_N": [
"@cite_11"
],
"mid": [
"2884276923"
],
"abstract": [
"During software maintenance, code comments help developers comprehend programs and reduce additional time spent on reading and navigating source code. Unfortunately, these comments are often mismatched, missing or outdated in the ... |
1904.12201 | 2942159993 | As an intuitive way of expression emotion, the animated Graphical Interchange Format (GIF) images have been widely used on social media. Most previous studies on automated GIF emotion recognition fail to effectively utilize GIF's unique properties, and this potentially limits the recognition performance. In this study,... | GIF Analysis. Bakhshi @cite_13 show that animated GIFs are more engaging than other social media types by studying over 3.9 million posts on Tumblr. Gygli @cite_12 propose to automatically generate animated GIFs from videos with 100K user-generated GIFs and the corresponding video sources. The MIT's GIFGIF platform is ... | {
"cite_N": [
"@cite_24",
"@cite_2",
"@cite_16",
"@cite_13",
"@cite_12"
],
"mid": [
"2017411072",
"2786355254",
"2578893299",
"2406020846",
"2963729528"
],
"abstract": [
"Animated GIFs are everywhere on the Web. Our work focuses on the computational prediction of em... |
1904.12201 | 2942159993 | As an intuitive way of expression emotion, the animated Graphical Interchange Format (GIF) images have been widely used on social media. Most previous studies on automated GIF emotion recognition fail to effectively utilize GIF's unique properties, and this potentially limits the recognition performance. In this study,... | Emotion Recognition. Emotion recognition @cite_0 @cite_6 has been an interesting topic for decades. On a large scale dataset @cite_23 , Rao @cite_8 propose a multi-level deep representations for emotion recognition. Multi-modal feature fusion @cite_22 is also proved to be effective. Instead of modeling emotion recognit... | {
"cite_N": [
"@cite_14",
"@cite_22",
"@cite_8",
"@cite_6",
"@cite_0",
"@cite_24",
"@cite_23"
],
"mid": [
"2767087747",
"2765354427",
"2951589678",
"2531468424",
"2074356411",
"2017411072",
"2347880541"
],
"abstract": [
"Over the last decade, automat... |
1904.12200 | 2941736865 | Magnetic resonance imaging (MRI) is being increasingly utilized to assess, diagnose, and plan treatment for a variety of diseases. The ability to visualize tissue in varied contrasts in the form of MR pulse sequences in a single scan provides valuable insights to physicians, as well as enabling automated systems perfor... | Though all the methods discussed above propose a multi-input method, none of the methods have been proposed to synthesize multiple missing sequences (multi-output), and in one single pass. All three methods @cite_50 , @cite_52 , and @cite_2 synthesize only sequence in the presence of varying number of input sequences, ... | {
"cite_N": [
"@cite_28",
"@cite_52",
"@cite_50",
"@cite_2"
],
"mid": [
"2964024004",
"2767044624",
"2004129819",
"2884442510"
],
"abstract": [
"Magnetic Resonance Angiography (MRA) has become an essential MR contrast for imaging and evaluation of vascular anatomy and relat... |
1904.12200 | 2941736865 | Magnetic resonance imaging (MRI) is being increasingly utilized to assess, diagnose, and plan treatment for a variety of diseases. The ability to visualize tissue in varied contrasts in the form of MR pulse sequences in a single scan provides valuable insights to physicians, as well as enabling automated systems perfor... | The main motivation for most synthesis methods is to retain the ability to meaningfully use some downstream analysis pipelines like segmentation or classification despite the partially missing input. However, there have been efforts by researchers working on those analysis pipelines to bypass any synthesis step by maki... | {
"cite_N": [
"@cite_45",
"@cite_8"
],
"mid": [
"2882978096",
"2502805798"
],
"abstract": [
"In a research context, image acquisition will often involve a pre-defined static protocol and the data will be of high quality. If we are to build applications that work in hospitals without signif... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.