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": [
"2086605530",
"2143252188",
"2740650368",
"2022637917",
"2120852651",
"2114207517"
],
"abstract": [
"We define and analyze a random coverage process of the @math -d... |
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": [
"2114207517",
"2042164227"
],
"abstract": [
"In cellular network models, the base stations are usually assumed to form a lattice or a Poisson point process (PPP). In reality, however, they are deployed neither fully regularly nor completely ... |
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": [
"2963847582"
],
"abstract": [
"Transmission capacity (TC) is a performance metric for wireless networks that measures the spatial intensity of successful transmissions per unit area, subject to a constraint on the permissible outage probability (where outage oc... |
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",
"1500932665"
],
"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... |
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": [
"1500932665",
"2266714125",
"2161190897"
],
"abstract": [
"The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V, with m demand ... |
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": [
"2116199025",
"2143535483"
],
"abstract": [
"We study in this paper a noncooperative approach for sharing resources of a common pool among users, wherein each user strives to maximize its own utility. The optimality notion is then a Nash equ... |
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": [
"2148911784",
"2057838148",
"2116199025"
],
"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 ga... |
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": [
"2072113937"
],
"abstract": [
"In the traffic assignment problem, first proposed by Wardrop in 1952, commuters select the shortest available path to travel from their origins to their destinations. We study a generalization of this problem in which competitors, ... |
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": [
"2100366181",
"2168150810",
"2063449729"
],
"abstract": [
"For pt.I see ibid., vol.44, no.7, p.2796-815 (1998). In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates... |
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": [
"2132158614",
"2114927595",
"2100366181",
"2168150810",
"2135963243"
],
"abstract": [
"This paper extends Khatri (1964, 1969) distribution of the largest eigenvalue of central compl... |
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": [
"2168729028"
],
"abstract": [
"Several contributions have been made so far to develop optimal multichannel linear filtering approaches and show their ability to reduce the acoustic noise. However, there has not been a clear unifying theoretical analysis of thei... |
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": [
"1529648317",
"2096797149",
"2605027943",
"2547342773"
],
"abstract": [
"We investigate the following problem: given a set of jobs and a set of people with preferences over the jobs, what is the optimal ... |
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": [
"2021734699"
],
"abstract": [
"We consider the problem of designing a revenue-maximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there exists an algorithm that finds the optimal randomiz... |
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": [
"2138256990",
"2156567124"
],
"abstract": [
"We address the problem of compressing correlated distributed sources, i.e., correlated sources which are not co-located or which cannot cooperate to directly exploit their correlation. We consider... |
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": [
"2138256990",
"2074430484",
"2109053700",
"2963175488",
"1512160561",
"2130507035",
"1964... |
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": [
"2074430484",
"2138185924"
],
"abstract": [
"This paper re-visits Shayevitz & Feder's recent ‘Posterior Matching Scheme’, an explicit, dynamical system encoder for communication with feedback that treats the message as a point on the [0,1] l... |
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": [
"2026910567",
"2251314334"
],
"abstract": [
"In this paper, we address the problem of characterizing the instances of the multiterminal source model of Csiszar and Narayan in which communication from all terminals is needed for establishing ... |
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": [
"1623444038",
"2132681112"
],
"abstract": [
"Materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be cost-driven and influenced by the workload experienced by the system. ... |
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": [
"1623444038",
"2055686029",
"2055899255",
"2950700385",
"2136027283",
"2753652460",
"2520925521",
"2963735494",
... |
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": [
"1597931764",
"1810232998",
"2098388305"
],
"abstract": [
"Recently, multi-query optimization techniques have been considered as beneficial in view selection setting. The main interest of such techniques relies in detecti... |
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": [
"2010149990"
],
"abstract": [
"Current trends in data management systems, such as cloud and multi-tenant databases, are leading to data processing environments that concurrently execute heterogeneous query workloads. At the same time, these systems need to sati... |
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": [
"2059326501",
"2078524330",
"2165481122",
"1548134621",
"2615162663",
"1851390469",
"20... |
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": [
"2017733008",
"2059326501",
"2050272677",
"1851390469",
"2250701144",
"2132729409"
],
"abstract": [
"Analytical queries defined on data warehouses are complex and... |
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": [
"2006997130",
"2435989427",
"2153107031",
"2963287528",
"2114413837"
],
"abstract": [
"We introduce static index pruning methods that significantly reduce the index size in informat... |
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": [
"2078524330",
"2017565019",
"2755583598",
"2109865546",
"2164792208"
],
"abstract": [
"A problem of considerable interest in the design of a database is the selection of indexes. In ... |
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": [
"2136593687"
],
"abstract": [
"As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of these domains. An alternate way of model... |
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": [
"2114129195",
"2133489575",
"2571527823",
"2953338282"
],
"abstract": [
"We address the problem of reconstructing a multiband signal from its sub-Nyquist pointwise samples, when the band locations are unk... |
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": [
"2571527823",
"2953338282",
"2053334136"
],
"abstract": [
"We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spa... |
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": [
"2337767373",
"2018793106",
"1535296432",
"2120514843",
"2903785932",
"2886568791",
"2... |
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": [
"2514172418",
"2620403523",
"2092433893",
"145176944",
"2083158002",
"1505083828"
],
"abstract": [
"User, content, and device names as a security primitive have b... |
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": [
"1984778122",
"2159587870",
"2901937773"
],
"abstract": [
"With the advent of content-centric networking (CCN) where contents can be cached on each CCN router, cache robustness will soon emerge as a serious concern for CC... |
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": [
"2901937773",
"2159587870",
"2949272603"
],
"abstract": [
"Information leakage of sensitive data has become one of the fast growing concerns among computer users. With adversaries turning to hardware for exploits, caches ... |
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": [
"2159587870",
"2071740737",
"2313059177"
],
"abstract": [
"Content-Centric Networking (CCN) is an emerging paradigm being considered as a possible replacement for the current IP-based host-centric Internet infrastructure.... |
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": [
"2161829417",
"1975016298",
"1992286709"
],
"abstract": [
"The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distribute... |
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": [
"2021150171",
"2022460695"
],
"abstract": [
"Recent advances on human motion analysis have made the extraction of human skeleton structure feasible, even from single depth images. This structure has been proven quite informative for discrimi... |
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": [
"2734934103",
"2613622891",
"2951039910",
"1645016350",
"170447308",
"2265209761"
],
"abstract": [
"We show that the category of coherent sheaves on the toric boun... |
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": [
"2734934103",
"2605842359"
],
"abstract": [
"We show that the category of coherent sheaves on the toric boundary divisor of a smooth quasiprojective DM toric stack is equivalent to the wrapped Fukaya category of a hypersurface in a complex to... |
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": [
"1997991368",
"2110117460",
"2568950526"
],
"abstract": [
"In this paper, we propose an efficient method to detect the underlying structures in data. The same as RANSAC, we randomly sample MSSs (minimal size samples) and ... |
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",
"1973616368"
],
"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": [
"1917516492",
"2123718282",
"2039750798"
],
"abstract": [
"We propose a temporal latent space model for link prediction in dynamic social networks, where the goal is to predict links over time based on a sequence of previou... |
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": [
"2136912397",
"2508366294",
"2747056667"
],
"abstract": [
"The problem of minimizing the rank of a matrix subject to affine constraints has applications in several areas including machine learning, and is known to be NP-ha... |
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": [
"2962909343",
"1770500012",
"2130345277"
],
"abstract": [
"In this paper, we improve existing results in the field of compressed sensing and matrix completion when sampled data may be grossly corrupted. We introduce three... |
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": [
"1969158823",
"2018102393"
],
"abstract": [
"Repair locality is a desirable property for erasure codes in distributed storage systems. Recently, different structures of local repair groups have been proposed in the definitions of repair loca... |
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": [
"2313077179",
"2757508077",
"2038147967",
"2964318046",
"1195044660",
"2094311777",
"2156... |
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": [
"2313077179",
"2038147967",
"2204578866",
"2115091888",
"2890259823",
"2143884379"
],
"abstract": [
"This paper aims at developing an integrated system for clothi... |
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": [
"2341569833",
"2283234189",
"1581592866",
"2045587041"
],
"abstract": [
"Scene understanding is a prerequisite to many high level tasks for any automated intelligent machine operating in real world enviro... |
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": [
"2963697527",
"2029731618",
"2474876375",
"2203062554"
],
"abstract": [
"Supervised object detection and semantic segmentation require object or even pixel level annotations. When there exist image level ... |
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": [
"2037954058",
"2605929543",
"2155080527",
"1969840923",
"2593150419",
"2056860348",
"1995444699",
"1969366022"
],
"abstract": [... |
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": [
"2963542991",
"1487583988",
"2410641892",
"1929903369",
"2559348937",
"2951001760",
"2068730032",
"2... |
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": [
"2108146080"
],
"abstract": [
"Fishers linear discriminant analysis (LDA) is a classical multivariate technique both for dimension reduction and classification. The data vectors are transformed into a low dimensional subspace such that the class centroids are sp... |
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": [
"2030378176"
],
"abstract": [
"Influence maximization, defined as finding a small subset of nodes that maximizes spread of influence in social networks, is NP-hard under both Linear Threshold (LT) and Independent Cascade (IC) models, where a line of greedy heuri... |
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": [
"2552732996",
"2151690061",
"2030378176",
"2069278600",
"2139297408",
"2605027943",
"2011730242"
],
"abstract": [
"Nowadays, in the world of lim... |
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": [
"2106597862",
"2964201038",
"2889208719"
],
"abstract": [
"Given a social graph, the problem of influence maximization is to determine a set of nodes that maximizes the spread of influences. While some recent research has ... |
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": [
"2166116275",
"2941057241",
"2963446085"
],
"abstract": [
"Approximation properties of a class of artificial neural networks are established. It is shown that feedforward networks with one layer of sigmoidal nonlinearities ... |
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": [
"2418306335",
"2124331852",
"2950268835",
"1988813039",
"2941057241",
"2963709899"
],
"abstract": [
"A Hilbert space embedding of a distribution---in short, a ke... |
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": [
"2941057241",
"1991143958"
],
"abstract": [
"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... |
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": [
"2950743785",
"2941057241",
"2899748887",
"2809090039",
"2942052807",
"2540366045",
"2763894180",
"2885059312"
],
"abstract": [... |
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": [
"2913010492",
"2276412021",
"2899748887",
"2942052807",
"2131524184"
],
"abstract": [
"We consider learning two layer neural networks using stochastic gradient descent. The mean-fiel... |
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": [
"2798657914"
],
"abstract": [
"Sequence-to-sequence attention-based models have recently shown very promising results on automatic speech recognition (ASR) tasks, which integrate an acoustic, pronunciation and language model into a single neural network. In thes... |
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": [
"2954346764"
],
"abstract": [
"This paper proposes a learning strategy that extracts object-part concepts from a pre-trained convolutional neural network (CNN), in an attempt to 1) explore explicit semantics hidden in CNN units and 2) gradually grow a semantical... |
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": [
"2259512711",
"2952453038",
"1952243512"
],
"abstract": [
"Long Short-Term Memory (LSTM) networks, a type of recurrent neural network with a more complex computational unit, have been successfully applied to a variety of s... |
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": [
"2964150020"
],
"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 a single fixed-length code vector, which can be used to predict se... |
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": [
"2786355254",
"2017411072",
"2578893299",
"2406020846",
"2963729528"
],
"abstract": [
"Animated GIFs are widely used on the Internet to express emotions, but their automatic analysis... |
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": [
"2765354427",
"2533262878",
"2548264631",
"2149940198",
"2765291577",
"2767618761",
"2548899748"
],
"abstract": [
"Current image emotion recogni... |
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": [
"2884442510",
"2030927653",
"2953204310",
"2101432564"
],
"abstract": [
"Accurate synthesis of a full 3D MR image containing tumours from available MRI (e.g. to replace an image that is currently unavai... |
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": [
"2884442510",
"2891179298"
],
"abstract": [
"Accurate synthesis of a full 3D MR image containing tumours from available MRI (e.g. to replace an image that is currently unavailable or corrupted) would provide a clinician as well as downstream ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.