aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict | template_name stringclasses 7
values | template stringclasses 7
values | rendered_input stringlengths 174 25.1k | rendered_output stringlengths 78 2.56k |
|---|---|---|---|---|---|---|---|---|
math9912167 | 1631980677 | Author(s): Kuperberg, Greg; Thurston, Dylan P. | Abstract: We give a purely topological definition of the perturbative quantum invariants of links and 3-manifolds associated with Chern-Simons field theory. Our definition is as close as possible to one given by Kontsevich. We will also establish some basic properties of... | Two other generalizations that can be considered are invariants of graphs in 3-manifolds, and invariants associated to other flat connections @cite_16 . We will analyze these in future work. Among other things, there should be a general relation between flat bundles and links in 3-manifolds on the one hand and finite c... | {
"cite_N": [
"@cite_16",
"@cite_26"
],
"mid": [
"1481005306",
"1641082372"
],
"abstract": [
"This note is a sequel to our earlier paper of the same title [4] and describes invariants of rational homology 3-spheres associated to acyclic orthogonal local systems. Our work is in the spirit o... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_16: This note is a sequel to our earlier paper of the same title [4] and describes invariants of rational homology 3-spheres associated to acyclic orthogonal local systems. Our work is in the spirit of the Axelrod–Singer p... | Author(s): Kuperberg, Greg; Thurston, Dylan P. | Abstract: We give a purely topological definition of the perturbative quantum invariants of links and 3-manifolds associated with Chern-Simons field theory. Our definition is as close as possible to one given by Kontsevich. We will also establish some basic properties of... |
cs9910011 | 2168463568 | A statistical model for segmentation and word discovery in child directed speech is presented. An incremental unsupervised learning algorithm to infer word boundaries based on this model is described and results of empirical tests showing that the algorithm is competitive with other models that have been used for simil... | Model Based Dynamic Programming, hereafter referred to as MBDP-1 @cite_0 , is probably the most recent work that addresses the exact same issue as that considered in this paper. Both the approach presented in this paper and Brent's MBDP-1 are based on explicit probability models. Approaches not based on explicit probab... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2074546930"
],
"abstract": [
"This paper presents a model-based, unsupervised algorithm for recovering word boundaries in a natural-language text from which they have been deleted. The algorithm is derived from a probability model of the source that generated t... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_0: This paper presents a model-based, unsupervised algorithm for recovering word boundaries in a natural-language text from which they have been deleted. The algorithm is derived from a probability model of the source that... | A statistical model for segmentation and word discovery in child directed speech is presented. An incremental unsupervised learning algorithm to infer word boundaries based on this model is described and results of empirical tests showing that the algorithm is competitive with other models that have been used for simil... |
cs9911003 | 2950670108 | We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic programming within each piece. The same methods can be used to solve other planar graph... | Recently we were able to characterize the graphs that can occur at most @math times as a subgraph isomorph in an @math -vertex planar graph: they are exactly the 3-connected planar graphs @cite_41 . However our proof does not lead to an efficient algorithm for 3-connected planar subgraph isomorphism. In this paper we u... | {
"cite_N": [
"@cite_41"
],
"mid": [
"2074992286"
],
"abstract": [
"It is well known that any planar graph contains at most O(n) complete subgraphs. We extend this to an exact characterization: G occurs O(n) times as a subgraph of any planar graph, if and only if G is three-connected. We generaliz... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_41: It is well known that any planar graph contains at most O(n) complete subgraphs. We extend this to an exact characterization: G occurs O(n) times as a subgraph of any planar graph, if and only if G is three-connected. ... | We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic programming within each piece. The same methods can be used to solve other planar graph... |
hep-th9908200 | 2160091034 | Daviau showed the equivalence of matrix Dirac theory, formulated within a spinor bundle (S_x C _x^4 ), to a Clifford algebraic formulation within space Clifford algebra (C ( R ^3 , ) M _ 2 ( C ) P ) Pauli algebra (matrices) ≃ ℍ ⨁ ℍ ≃ biquaternions. We will show, that Daviau's map θ: ( : C ^4 M _ 2 ( C ) ) is an isomorp... | A further genuine and important approach to the spinor-tensor transition was developed starting probably with Crawford by P. Lounesto, @cite_6 and references there. He investigated the question, how a spinor field can be reconstructed from known tensor densities. The major characterization is derived, using Fierz-Kofin... | {
"cite_N": [
"@cite_6"
],
"mid": [
"2082565556"
],
"abstract": [
"A historical review of spinors is given together with a construction of spinor spaces as minimal left ideals of Clifford algebras. Spinor spaces of euclidean spaces over reals have a natural linear structure over reals, complex num... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_6: A historical review of spinors is given together with a construction of spinor spaces as minimal left ideals of Clifford algebras. Spinor spaces of euclidean spaces over reals have a natural linear structure over reals,... | Daviau showed the equivalence of matrix Dirac theory, formulated within a spinor bundle (S_x C _x^4 ), to a Clifford algebraic formulation within space Clifford algebra (C ( R ^3 , ) M _ 2 ( C ) P ) Pauli algebra (matrices) ≃ ℍ ⨁ ℍ ≃ biquaternions. We will show, that Daviau's map θ: ( : C ^4 M _ 2 ( C ) ) is an isomorp... |
cs9903014 | 1612660921 | We present an open architecture for just-in-time code generation and dynamic code optimization that is flexible, customizable, and extensible. While previous research has primarily investigated functional aspects of such a system, architectural aspects have so far remained unexplored. In this paper, we argue that these... | Pioneering research in dynamic runtime optimization was done by Hansen @cite_8 who first described a fully automated system for runtime code optimization. His system was similar in structure to our system---it was composed of a loader, a profiler, and an optimizer---but used profiling data only to decide when to optimi... | {
"cite_N": [
"@cite_8"
],
"mid": [
"2101776604"
],
"abstract": [
"Abstract : This thesis investigates adaptive compiler systems that perform, during program execution, code optimizations based on the dynamic behavior of the program as opposed to current approaches that employ a fixed code generat... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_8: Abstract : This thesis investigates adaptive compiler systems that perform, during program execution, code optimizations based on the dynamic behavior of the program as opposed to current approaches that employ a fixed ... | We present an open architecture for just-in-time code generation and dynamic code optimization that is flexible, customizable, and extensible. While previous research has primarily investigated functional aspects of such a system, architectural aspects have so far remained unexplored. In this paper, we argue that these... |
cs9903014 | 1612660921 | We present an open architecture for just-in-time code generation and dynamic code optimization that is flexible, customizable, and extensible. While previous research has primarily investigated functional aspects of such a system, architectural aspects have so far remained unexplored. In this paper, we argue that these... | Hansen's work was followed by several other projects that have investigated the benefits of runtime optimization: the Smalltalk @cite_33 and SELF @cite_0 systems that focused on the benefits of dynamic optimization in an object-oriented environment; Morph'', a project developed at Harvard University @cite_16 ; and the ... | {
"cite_N": [
"@cite_30",
"@cite_18",
"@cite_4",
"@cite_33",
"@cite_0",
"@cite_16"
],
"mid": [
"1542872339",
"2112378054",
"1541680547",
"1993318777",
"2167997514",
"2153228154"
],
"abstract": [
"Despite the apparent success of the Java Virtual Machine, its ... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_30: Despite the apparent success of the Java Virtual Machine, its lackluster performance makes it ill-suited for many speed-critical applications. Although the latest just-in-time compilers and dedicated Java processors tr... | We present an open architecture for just-in-time code generation and dynamic code optimization that is flexible, customizable, and extensible. While previous research has primarily investigated functional aspects of such a system, architectural aspects have so far remained unexplored. In this paper, we argue that these... |
cs9903014 | 1612660921 | We present an open architecture for just-in-time code generation and dynamic code optimization that is flexible, customizable, and extensible. While previous research has primarily investigated functional aspects of such a system, architectural aspects have so far remained unexplored. In this paper, we argue that these... | Common to the above-mentioned work is that the main focus has always been on functional aspects, that is how to profile and which optimizations to perform. Related to this is research on how to boost application performance by combining profiling data and code optimizations at compile time (not at runtime), including w... | {
"cite_N": [
"@cite_35",
"@cite_26",
"@cite_22",
"@cite_10",
"@cite_29",
"@cite_3",
"@cite_13",
"@cite_25",
"@cite_12"
],
"mid": [
"2141293928",
"2030400507",
"2164470257",
"2117703621",
"",
"1524758670",
"2116672403",
"2162612712",
"1777393... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_35: Polymorphic inline caches (PICs) provide a new way to reduce the overhead of polymorphic message sends by extending inline caches to include more than one cached lookup result per call site. For a set of typical object... | We present an open architecture for just-in-time code generation and dynamic code optimization that is flexible, customizable, and extensible. While previous research has primarily investigated functional aspects of such a system, architectural aspects have so far remained unexplored. In this paper, we argue that these... |
cs9903018 | 1593496962 | Scripting languages are becoming more and more important as a tool for software development, as they provide great flexibility for rapid prototyping and for configuring componentware applications. In this paper we present LuaJava, a scripting tool for Java. LuaJava adopts Lua, a dynamically typed interpreted language, ... | For Tcl @cite_13 two integration solutions exist: the TclBlend binding @cite_11 and the Jacl implementation @cite_14 . TclBlend is a binding between Java and Tcl, which, as LuaJava, allows Java objects to be manipulated by scripts. Some operations, such as access to fields and static method invocations, require specifi... | {
"cite_N": [
"@cite_14",
"@cite_13",
"@cite_11"
],
"mid": [
"2162914120",
"2789138443",
"196441419"
],
"abstract": [
"This paper describes the motivations and strategies behind our group’s efforts to integrate the Tcl and Java programming languages. From the Java perspective, we w... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_14: This paper describes the motivations and strategies behind our group’s efforts to integrate the Tcl and Java programming languages. From the Java perspective, we wish to create a powerful scripting solution for Java ap... | Scripting languages are becoming more and more important as a tool for software development, as they provide great flexibility for rapid prototyping and for configuring componentware applications. In this paper we present LuaJava, a scripting tool for Java. LuaJava adopts Lua, a dynamically typed interpreted language, ... |
hep-th9807171 | 1774239421 | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... | The main objective of this chapter was to study the basic @math -branes that one encounters in M-theory, and to treat them in a unified way. The need to unify the treatment is inspired by U-duality @cite_22 @cite_86 @cite_144 , which states that from the effective lower dimensional space-time point of view, all the cha... | {
"cite_N": [
"@cite_86",
"@cite_22",
"@cite_144"
],
"mid": [
"1987603965",
"2141847212",
""
],
"abstract": [
"Abstract The strong coupling dynamics of string theories in dimension d ⩾ 4 are studied. It is argued, among other things, that eleven-dimensional supergravity arises as a... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_86: Abstract The strong coupling dynamics of string theories in dimension d ⩾ 4 are studied. It is argued, among other things, that eleven-dimensional supergravity arises as a low energy limit of the ten-dimensional Type I... | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... |
hep-th9807171 | 1774239421 | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... | It should also not be underestimated that the derivation of the intersecting solutions presented in this chapter is a thorough consistency check of all the dualities acting on, and between, the supergravity theories. It is straightforward to check that, starting from one definite configuration, all its dual configurati... | {
"cite_N": [
"@cite_191",
"@cite_61"
],
"mid": [
"2130491267",
"2045285156"
],
"abstract": [
"Abstract The Bekenstein-Hawking area-entropy relation S BH = A 4 is derived for a class of five-dimensional extremal black holes in string theory by counting the degeneracy of BPS solition bound ... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_191: Abstract The Bekenstein-Hawking area-entropy relation S BH = A 4 is derived for a class of five-dimensional extremal black holes in string theory by counting the degeneracy of BPS solition bound states.
@cite_61: Abs... | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... |
hep-th9807171 | 1774239421 | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... | Some of the intersection rules intersectionrules point towards an M-theory interpretation in terms of open branes ending on other branes. This idea will be elaborated and made firmer in the next chapter. It suffices to say here that this interpretation is consistent with dualities if we postulate that the open characte... | {
"cite_N": [
"@cite_143",
"@cite_38",
"@cite_176"
],
"mid": [
"1981788818",
"2032622195",
""
],
"abstract": [
"Abstract Various aspects of branes in the recently proposed matrix model for M-theory are discussed. A careful analysis of the supersymmetry algebra of the matrix model u... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_143: Abstract Various aspects of branes in the recently proposed matrix model for M-theory are discussed. A careful analysis of the supersymmetry algebra of the matrix model uncovers some central changes which can be activ... | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... |
hep-th9807171 | 1774239421 | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... | In this chapter we presented only extremal configurations of intersecting branes. The natural further step to take would be to consider also non-extremal configurations of intersecting branes. There is however a subtlety: there could be a difference between intersections of non-extremal branes, and non-extremal interse... | {
"cite_N": [
"@cite_48",
"@cite_81",
"@cite_16"
],
"mid": [
"2054280159",
"",
"2086840642"
],
"abstract": [
"Abstract We present non-extreme generalisations of intersecting p -brane solutions of eleven-dimensional supergravity which upon toroidal compactification reduce to non-ext... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_48: Abstract We present non-extreme generalisations of intersecting p -brane solutions of eleven-dimensional supergravity which upon toroidal compactification reduce to non-extreme static black holes in dimensions D = 4, D... | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... |
hep-th9807171 | 1774239421 | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... | Supergravity solutions corresponding to D-branes at angles were found in @cite_31 @cite_59 @cite_178 . The resulting solutions contain as expected off-diagonal elements in the internal metric, and the derivation from the equations of motion as in @cite_59 is accordingly rather intricated. | {
"cite_N": [
"@cite_31",
"@cite_178",
"@cite_59"
],
"mid": [
"2125497699",
"2048444779",
""
],
"abstract": [
"A low-energy background field solution is presented which describes several D-membranes oriented at angles with respect to one another. The mass and charge densities for t... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_31: A low-energy background field solution is presented which describes several D-membranes oriented at angles with respect to one another. The mass and charge densities for this configuration are computed and found to sat... | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... |
hep-th9807171 | 1774239421 | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... | Other half-supersymmetric bound states of this class are the @math multiplets of 1- and 5-branes in type IIB theory @cite_95 @cite_0 , or more precisely the configurations F1 @math D1 and NS5 @math D5, also called @math 1- and 5-branes, where @math is the NSNS charge and @math the RR charge of the compound. The classic... | {
"cite_N": [
"@cite_0",
"@cite_95"
],
"mid": [
"2022574854",
"2127535930"
],
"abstract": [
"The recent discovery of an explicit conformal field theory description of Type II p-branes makes it possible to investigate the existence of bound states of such objects. In particular, it is possi... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_0: The recent discovery of an explicit conformal field theory description of Type II p-branes makes it possible to investigate the existence of bound states of such objects. In particular, it is possible with reasonable pr... | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... |
hep-th9807171 | 1774239421 | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... | In @cite_106 (inspired by @cite_54 ) a solution is presented which corresponds to a M5 @math M5=1 configuration, which follows the harmonic superposition rule, provided however that the harmonic functions depend on the respective relative transverse space (i.e. they are functions of two different spaces). The problem n... | {
"cite_N": [
"@cite_54",
"@cite_106",
"@cite_89"
],
"mid": [
"2065552713",
"1992572456",
""
],
"abstract": [
"We derive an exact stringlike soliton solution of [ital D]=10 heterotic string theory. The solution possesses SU(2)[times]SU(2) instanton structure in the eight-dimensiona... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_54: We derive an exact stringlike soliton solution of [ital D]=10 heterotic string theory. The solution possesses SU(2)[times]SU(2) instanton structure in the eight-dimensional space transverse to the world sheet of the so... | The thesis begins with an introduction to M-theory (at a graduate student's level), starting from perturbative string theory and proceeding to dualities, D-branes and finally Matrix theory. The following chapter treats, in a self-contained way, of general classical p-brane solutions. Black and extremal branes are revie... |
1903.05435 | 2921710190 | In this work, we are interested in the applications of big data in the telecommunication domain, analysing two weeks of datasets provided by Telecom Italia for Milan and Trento. Our objective is to identify hotspots which are places with very high communication traffic relative to others and measure the interaction bet... | Nowadays, telecom companies use widely big data in order to mine the behaviour of their customers, improve the quality of service that they provide and reduce the customers' churn. Towards this direction, demographic statistics, network deployments and call detail records (CDRs) are key factors that need to be carefull... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2741581007"
],
"abstract": [
"In a world of open data and large-scale measurements, it is often feasible to obtain a real-world trace to fit to one's research problem. Feasible, however, does not imply simple. Taking next-generation cellular network planning as... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_5: In a world of open data and large-scale measurements, it is often feasible to obtain a real-world trace to fit to one's research problem. Feasible, however, does not imply simple. Taking next-generation cellular network... | In this work, we are interested in the applications of big data in the telecommunication domain, analysing two weeks of datasets provided by Telecom Italia for Milan and Trento. Our objective is to identify hotspots which are places with very high communication traffic relative to others and measure the interaction bet... |
1903.05435 | 2921710190 | In this work, we are interested in the applications of big data in the telecommunication domain, analysing two weeks of datasets provided by Telecom Italia for Milan and Trento. Our objective is to identify hotspots which are places with very high communication traffic relative to others and measure the interaction bet... | For example, the authors in @cite_4 analyse an heterogeneous cellular network which consists of different types of nodes, such as macrocells and microcells. Nowadays a popular model is the one from Wyner @cite_0 , but it fails to fully capture a real heterogeneous cellular network because it is simplistic. Another appr... | {
"cite_N": [
"@cite_0",
"@cite_9",
"@cite_4"
],
"mid": [
"2131070905",
"",
"2005411736"
],
"abstract": [
"The Wyner model has been widely used to model and analyze cellular networks due to its simplicity and analytical tractability. Its key aspects include fixed user locations and... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_0: The Wyner model has been widely used to model and analyze cellular networks due to its simplicity and analytical tractability. Its key aspects include fixed user locations and the deterministic and homogeneous interfere... | In this work, we are interested in the applications of big data in the telecommunication domain, analysing two weeks of datasets provided by Telecom Italia for Milan and Trento. Our objective is to identify hotspots which are places with very high communication traffic relative to others and measure the interaction bet... |
1903.05355 | 2968491849 | Learning the dynamics of robots from data can help achieve more accurate tracking controllers, or aid their navigation algorithms. However, when the actual dynamics of the robots change due to external conditions, on-line adaptation of their models is required to maintain high fidelity performance. In this work, a fram... | In the field of marine robotics, @cite_10 used locally weighted projection regression to compensate the mismatch between the physics based model and the sensors reading of the AUV Nessie. Auto-regressive networks augmented with a genetic algorithm as a gating network were used to identify the model of a simulated AUV w... | {
"cite_N": [
"@cite_14",
"@cite_16",
"@cite_10",
"@cite_11"
],
"mid": [
"2766583623",
"2774694743",
"2022798939",
""
],
"abstract": [
"This work addresses a data driven approach which employs a machine learning technique known as Support Vector Regression (SVR), to identif... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_14: This work addresses a data driven approach which employs a machine learning technique known as Support Vector Regression (SVR), to identify the coupled dynamical model of an autonomous underwater vehicle. To train the ... | Learning the dynamics of robots from data can help achieve more accurate tracking controllers, or aid their navigation algorithms. However, when the actual dynamics of the robots change due to external conditions, on-line adaptation of their models is required to maintain high fidelity performance. In this work, a fram... |
1903.05454 | 2950587559 | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. For matching, our system uses memory vectors aggregated from global image descriptors based on convolutional features to facilitate fast searching in the database. To speed up searching, a c... | In recent years, research regarding image matching has been influenced by the developments in other areas of computer vision. Deep learning architectures have been developed both for image matching @cite_10 @cite_1 @cite_17 and geopositioning @cite_13 @cite_5 @cite_18 with attractive results. | {
"cite_N": [
"@cite_13",
"@cite_18",
"@cite_1",
"@cite_5",
"@cite_10",
"@cite_17"
],
"mid": [
"1946093182",
"2199890863",
"2609950940",
"1969891195",
"2204975001",
"2614218061"
],
"abstract": [
"The recent availability of geo-tagged images and rich geospati... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_13: The recent availability of geo-tagged images and rich geospatial data has inspired a number of algorithms for image based geolocalization. Most approaches predict the location of a query image by matching to ground-lev... | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. For matching, our system uses memory vectors aggregated from global image descriptors based on convolutional features to facilitate fast searching in the database. To speed up searching, a c... |
1903.05454 | 2950587559 | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. For matching, our system uses memory vectors aggregated from global image descriptors based on convolutional features to facilitate fast searching in the database. To speed up searching, a c... | Convolutional features extracted from the deep layers of CNNs have shown great utility when addressing image matching and retrieval problems. Babenko @cite_10 employ pre-trained networks to generate descriptors based on high-level convolutional features used for retrieving images of various landmarks. Sunderhauf @cite_... | {
"cite_N": [
"@cite_8",
"@cite_10",
"@cite_2"
],
"mid": [
"2518534307",
"2204975001",
"1162411702"
],
"abstract": [
"Recent work by [1] demonstrated improved visual place recognition using proposal regions coupled with features from convolutional neural networks (CNN) to match lan... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_8: Recent work by [1] demonstrated improved visual place recognition using proposal regions coupled with features from convolutional neural networks (CNN) to match landmarks between views. In this work we extend the approa... | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. For matching, our system uses memory vectors aggregated from global image descriptors based on convolutional features to facilitate fast searching in the database. To speed up searching, a c... |
1903.05454 | 2950587559 | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. For matching, our system uses memory vectors aggregated from global image descriptors based on convolutional features to facilitate fast searching in the database. To speed up searching, a c... | The problem of geopositioning can be seen as a dedicated branch of image retrieval. In this case, the objective is to compute extrinsic parameters (or coordinates) of a camera capturing the query image, based on the matched georeferenced images from a database. There exist many different algorithms and neural network a... | {
"cite_N": [
"@cite_5",
"@cite_18",
"@cite_13"
],
"mid": [
"1969891195",
"2199890863",
"1946093182"
],
"abstract": [
"We address the problem of geo-registering ground-based multi-view stereo models by ground-to-aerial image matching. The main contribution is a fully automated geo-... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_5: We address the problem of geo-registering ground-based multi-view stereo models by ground-to-aerial image matching. The main contribution is a fully automated geo-registration pipeline with a novel viewpoint-dependent m... | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. For matching, our system uses memory vectors aggregated from global image descriptors based on convolutional features to facilitate fast searching in the database. To speed up searching, a c... |
1903.05454 | 2950587559 | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. For matching, our system uses memory vectors aggregated from global image descriptors based on convolutional features to facilitate fast searching in the database. To speed up searching, a c... | A common factor of the above work is that it either requires the combination of aerial and street-level images for geopositioning, or extensive training on specific datasets. Both cases and their solutions cannot be easily generalized. In our approach, we utilize georeferenced, street-level panoramic images only and a ... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2609950940"
],
"abstract": [
"Location recognition is commonly treated as visual instance retrieval on \"street view\" imagery. The dataset items and queries are panoramic views, i.e. groups of images taken at a single location. This work introduces a novel pan... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_1: Location recognition is commonly treated as visual instance retrieval on "street view" imagery. The dataset items and queries are panoramic views, i.e. groups of images taken at a single location. This work introduces a... | In this work, we present a camera geopositioning system based on matching a query image against a database with panoramic images. For matching, our system uses memory vectors aggregated from global image descriptors based on convolutional features to facilitate fast searching in the database. To speed up searching, a c... |
1903.05524 | 2972959293 | In this paper, we study the relationship between two crucial properties in linear dynamical networks of diffusively coupled agents, that is controllability and robustness to noise and structural changes in the network. In particular, for any given network size and diameter, we identify networks that are maximally robus... | Kirchhoff index or equivalently effective graph resistance based measures have been instrumental in quantifying the effect of noise on the expected steady state dispersion in linear dynamical networks, particularly in the ones with the consensus dynamics, for instance see @cite_23 @cite_8 @cite_22 . Furthermore, limits... | {
"cite_N": [
"@cite_26",
"@cite_22",
"@cite_8",
"@cite_9",
"@cite_1",
"@cite_0",
"@cite_23",
"@cite_10",
"@cite_11"
],
"mid": [
"1987717935",
"2287065438",
"1818569528",
"",
"",
"2156286761",
"2099689250",
"",
"2736121037"
],
"abstract":... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_26: The effective resistance between two nodes of a weighted graph is the electrical resistance seen between the nodes of a resistor network with branch conductances given by the edge weights. The effective resistance come... | In this paper, we study the relationship between two crucial properties in linear dynamical networks of diffusively coupled agents, that is controllability and robustness to noise and structural changes in the network. In particular, for any given network size and diameter, we identify networks that are maximally robus... |
1903.05524 | 2972959293 | In this paper, we study the relationship between two crucial properties in linear dynamical networks of diffusively coupled agents, that is controllability and robustness to noise and structural changes in the network. In particular, for any given network size and diameter, we identify networks that are maximally robus... | To quantify controllability, several approaches have been adapted, including determining the minimum number of inputs (leader nodes) needed to (structurally or strong structurally) control a network, determining the worst-case control energy, metrics based on controllability Gramians, and so on (e.g., see @cite_7 @cite... | {
"cite_N": [
"@cite_18",
"@cite_14",
"@cite_4",
"@cite_7",
"@cite_3",
"@cite_2",
"@cite_5",
"@cite_15",
"@cite_13",
"@cite_25",
"@cite_20",
"@cite_17"
],
"mid": [
"",
"",
"",
"2111725629",
"",
"",
"1938602245",
"",
"2315383458",
... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_18:
@cite_14:
@cite_4:
@cite_7: This paper studies the problem of controlling complex networks, i.e., the joint problem of selecting a set of control nodes and of designing a control input to steer a network to a tar... | In this paper, we study the relationship between two crucial properties in linear dynamical networks of diffusively coupled agents, that is controllability and robustness to noise and structural changes in the network. In particular, for any given network size and diameter, we identify networks that are maximally robus... |
1903.05524 | 2972959293 | In this paper, we study the relationship between two crucial properties in linear dynamical networks of diffusively coupled agents, that is controllability and robustness to noise and structural changes in the network. In particular, for any given network size and diameter, we identify networks that are maximally robus... | Very recently in @cite_21 , trade-off between controllability and fragility in complex networks is investigated. Fragility measures the smallest perturbation in edge weights to make the network unstable. Authors in @cite_21 show that networks that require small control energy, as measured by the eigen values of the con... | {
"cite_N": [
"@cite_21"
],
"mid": [
"2887109490"
],
"abstract": [
"Mathematical theories and empirical evidence suggest that several complex natural and man-made systems are fragile: as their size increases, arbitrarily small and localized alterations of the system parameters may trigger system-w... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_21: Mathematical theories and empirical evidence suggest that several complex natural and man-made systems are fragile: as their size increases, arbitrarily small and localized alterations of the system parameters may trig... | In this paper, we study the relationship between two crucial properties in linear dynamical networks of diffusively coupled agents, that is controllability and robustness to noise and structural changes in the network. In particular, for any given network size and diameter, we identify networks that are maximally robus... |
cmp-lg9408015 | 2952406681 | Effective problem solving among multiple agents requires a better understanding of the role of communication in collaboration. In this paper we show that there are communicative strategies that greatly improve the performance of resource-bounded agents, but that these strategies are highly sensitive to the task require... | Design-World is also based on the method used in Carletta's JAM simulation for the Edinburgh Map-Task @cite_10 . JAM is based on the Map-Task Dialogue corpus, where the goal of the task is for the planning agent, the instructor, to instruct the reactive agent, the instructee, how to get from one place to another on the... | {
"cite_N": [
"@cite_10"
],
"mid": [
"2159574206"
],
"abstract": [
"The Principle of Parsimony states that people usually try to complete tasks with the least effort that will produce a satisfactory solution. In task-oriented dialogue, this produces a tension between conveying information carefull... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_10: The Principle of Parsimony states that people usually try to complete tasks with the least effort that will produce a satisfactory solution. In task-oriented dialogue, this produces a tension between conveying informat... | Effective problem solving among multiple agents requires a better understanding of the role of communication in collaboration. In this paper we show that there are communicative strategies that greatly improve the performance of resource-bounded agents, but that these strategies are highly sensitive to the task require... |
cs9907027 | 2949190809 | The aim of the Alma project is the design of a strongly typed constraint programming language that combines the advantages of logic and imperative programming. The first stage of the project was the design and implementation of Alma-0, a small programming language that provides a support for declarative programming wit... | We concentrate here on the related work involving addition of constraints to imperative languages. For an overview of related work pertaining to the language we refer the reader to @cite_0 . | {
"cite_N": [
"@cite_0"
],
"mid": [
"1968265180"
],
"abstract": [
"We describe here an implemented small programming language, called Alma-O, that augments the expressive power of imperative programming by a limited number of features inspired by the logic programming paradigm. These additions enc... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_0: We describe here an implemented small programming language, called Alma-O, that augments the expressive power of imperative programming by a limited number of features inspired by the logic programming paradigm. These a... | The aim of the Alma project is the design of a strongly typed constraint programming language that combines the advantages of logic and imperative programming. The first stage of the project was the design and implementation of Alma-0, a small programming language that provides a support for declarative programming wit... |
cmp-lg9709007 | 1578881253 | Automatic Text Categorization (TC) is a complex and useful task for many natural language applications, and is usually performed through the use of a set of manually classified documents, a training collection. We suggest the utilization of additional resources like lexical databases to increase the amount of informati... | To our knowledge, lexical databases have been used only once before in TC, apart from our previous work. Hearst @cite_10 adapted a disambiguation algorithm by Yarowsky using WordNet to recognize category occurrences. Categories are made of WordNet terms, which is not the general case of standard or user-defined categor... | {
"cite_N": [
"@cite_10",
"@cite_23"
],
"mid": [
"1493108551",
"1575569168"
],
"abstract": [
"This dissertation investigates the role of contextual information in the automated retrieval and display of full-text documents, using robust natural language processing algorithms to automaticall... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_10: This dissertation investigates the role of contextual information in the automated retrieval and display of full-text documents, using robust natural language processing algorithms to automatically detect structure in ... | Automatic Text Categorization (TC) is a complex and useful task for many natural language applications, and is usually performed through the use of a set of manually classified documents, a training collection. We suggest the utilization of additional resources like lexical databases to increase the amount of informati... |
cmp-lg9709007 | 1578881253 | Automatic Text Categorization (TC) is a complex and useful task for many natural language applications, and is usually performed through the use of a set of manually classified documents, a training collection. We suggest the utilization of additional resources like lexical databases to increase the amount of informati... | Lexical databases have been employed recently in word sense disambiguation. For example, Agirre and Rigau @cite_4 make use of a semantic distance that takes into account structural factors in WordNet for achieving good results for this task. Additionally, Resnik @cite_3 combines the use of WordNet and a text collection... | {
"cite_N": [
"@cite_4",
"@cite_3",
"@cite_11"
],
"mid": [
"",
"1608874027",
"2157025692"
],
"abstract": [
"",
"Word groupings useful for language processing tasks are increasingly available, as thesauri appear on-line, and as distributional word clustering techniques improve. ... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_4:
@cite_3: Word groupings useful for language processing tasks are increasingly available, as thesauri appear on-line, and as distributional word clustering techniques improve. However, for many tasks, one is interested... | Automatic Text Categorization (TC) is a complex and useful task for many natural language applications, and is usually performed through the use of a set of manually classified documents, a training collection. We suggest the utilization of additional resources like lexical databases to increase the amount of informati... |
cmp-lg9706006 | 2953123431 | Learning problems in the text processing domain often map the text to a space whose dimensions are the measured features of the text, e.g., its words. Three characteristic properties of this domain are (a) very high dimensionality, (b) both the learned concepts and the instances reside very sparsely in the feature spac... | The methods that are most similar to our techniques are the on-line algorithms used in @cite_16 and @cite_10 . In the first, two algorithms, a multiplicative update and additive update algorithms suggested in @cite_5 are evaluated in the domain, and are shown to perform somewhat better than Rocchio's algorithm. While b... | {
"cite_N": [
"@cite_5",
"@cite_16",
"@cite_10"
],
"mid": [
"2069317438",
"",
"2440833291"
],
"abstract": [
"We consider two algorithm for on-line prediction based on a linear model. The algorithms are the well-known Gradient Descent (GD) algorithm and a new algorithm, which we cal... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_5: We consider two algorithm for on-line prediction based on a linear model. The algorithms are the well-known Gradient Descent (GD) algorithm and a new algorithm, which we call EG(+ -). They both maintain a weight vector ... | Learning problems in the text processing domain often map the text to a space whose dimensions are the measured features of the text, e.g., its words. Three characteristic properties of this domain are (a) very high dimensionality, (b) both the learned concepts and the instances reside very sparsely in the feature spac... |
cmp-lg9701003 | 2952751702 | In expert-consultation dialogues, it is inevitable that an agent will at times have insufficient information to determine whether to accept or reject a proposal by the other agent. This results in the need for the agent to initiate an information-sharing subdialogue to form a set of shared beliefs within which the agen... | Grosz, Sidner and Lochbaum @cite_7 @cite_1 developed a SharedPlan approach to modelling collaborative discourse, and Sidner formulated an artificial language for modeling such discourse. Sidner viewed a collaborative planning process as proposal acceptance and proposal rejection sequences. Her artificial language treat... | {
"cite_N": [
"@cite_1",
"@cite_7"
],
"mid": [
"2148389694",
"332028463"
],
"abstract": [
"A model of plan recognition in discourse must be based on intended recognition, distinguish each agent's beliefs and intentions from the other's, and avoid assumptions about the correctness or comple... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_1: A model of plan recognition in discourse must be based on intended recognition, distinguish each agent's beliefs and intentions from the other's, and avoid assumptions about the correctness or completeness of the agents... | In expert-consultation dialogues, it is inevitable that an agent will at times have insufficient information to determine whether to accept or reject a proposal by the other agent. This results in the need for the agent to initiate an information-sharing subdialogue to form a set of shared beliefs within which the agen... |
cmp-lg9701003 | 2952751702 | In expert-consultation dialogues, it is inevitable that an agent will at times have insufficient information to determine whether to accept or reject a proposal by the other agent. This results in the need for the agent to initiate an information-sharing subdialogue to form a set of shared beliefs within which the agen... | Several researchers have studied the role of clarification dialogues in disambiguating user plans @cite_3 @cite_5 and in understanding referring expressions @cite_8 . developed an automated librarian that could revise its beliefs and intentions and could generate responses as an attempt to revise the user's beliefs and... | {
"cite_N": [
"@cite_5",
"@cite_3",
"@cite_8"
],
"mid": [
"",
"2037768686",
"1541473376"
],
"abstract": [
"",
"Recognizing the plan underlying a query aids in the generation of an appropriate response. In this paper, we address the problem of how to generate cooperative respons... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_5:
@cite_3: Recognizing the plan underlying a query aids in the generation of an appropriate response. In this paper, we address the problem of how to generate cooperative responses when the user's plan is ambiguous. We ... | In expert-consultation dialogues, it is inevitable that an agent will at times have insufficient information to determine whether to accept or reject a proposal by the other agent. This results in the need for the agent to initiate an information-sharing subdialogue to form a set of shared beliefs within which the agen... |
cmp-lg9606025 | 2952364737 | This paper presents an analysis conducted on a corpus of software instructions in French in order to establish whether task structure elements (the procedural representation of the users' tasks) are alone sufficient to control the grammatical resources of a text generator. We show that the construct of genre provides a... | The results from our linguistic analysis are consistent with other research on sublanguages in the instructions domain, in both French and English, e.g., @cite_5 @cite_4 . Our analysis goes beyond previous work by identifying within the discourse context the means for exercising explicit control over a text generator. | {
"cite_N": [
"@cite_5",
"@cite_4"
],
"mid": [
"2047374384",
"2131196772"
],
"abstract": [
"This paper discusses an approach to planning the content of instructional texts. The research is based on a corpus study of 15 French procedural texts ranging from step-by-step device manuals to gen... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_5: This paper discusses an approach to planning the content of instructional texts. The research is based on a corpus study of 15 French procedural texts ranging from step-by-step device manuals to general artistic procedu... | This paper presents an analysis conducted on a corpus of software instructions in French in order to establish whether task structure elements (the procedural representation of the users' tasks) are alone sufficient to control the grammatical resources of a text generator. We show that the construct of genre provides a... |
cmp-lg9505006 | 1617827527 | In previous work we studied a new type of DCGs, Datalog grammars, which are inspired on database theory. Their efficiency was shown to be better than that of their DCG counterparts under (terminating) OLDT-resolution. In this article we motivate a variant of Datalog grammars which allows us a meta-grammatical treatment... | A notion that is central to recent work on ellipsis, and which has been present in embryonic form, as we have seen, even in the early work on coordination, is that of parallelism as a key element in the determination of implicit meanings. Asher @cite_3 defines parallelism as | {
"cite_N": [
"@cite_3"
],
"mid": [
"1495022714"
],
"abstract": [
"Preface. Introduction. 1. From Events to Propositions: a Tour of Abstract Entities, Eventualities and the Nominals that Denote them. 2. A Crash Course in DRT. 3. Attitudes and Attitude Descriptions. 4. The Semantic Representation f... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_3: Preface. Introduction. 1. From Events to Propositions: a Tour of Abstract Entities, Eventualities and the Nominals that Denote them. 2. A Crash Course in DRT. 3. Attitudes and Attitude Descriptions. 4. The Semantic Repr... | In previous work we studied a new type of DCGs, Datalog grammars, which are inspired on database theory. Their efficiency was shown to be better than that of their DCG counterparts under (terminating) OLDT-resolution. In this article we motivate a variant of Datalog grammars which allows us a meta-grammatical treatment... |
cmp-lg9505006 | 1617827527 | In previous work we studied a new type of DCGs, Datalog grammars, which are inspired on database theory. Their efficiency was shown to be better than that of their DCG counterparts under (terminating) OLDT-resolution. In this article we motivate a variant of Datalog grammars which allows us a meta-grammatical treatment... | a) neither method formulates exactly how parallelism is to be determined- it is just postulated as a prerequisite to the resolution of ellipsis (although @cite_6 speculates on possible ways of formulating this, leaving it for future work) | {
"cite_N": [
"@cite_6"
],
"mid": [
"2119997945"
],
"abstract": [
"We describe an implementation in Carpenter's typed feature formalism, ALE, of a discourse grammar of the kind proposed by Scha, Polanyi, et al We examine their method for resolving parallelism-dependent anaphora and show that there... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_6: We describe an implementation in Carpenter's typed feature formalism, ALE, of a discourse grammar of the kind proposed by Scha, Polanyi, et al We examine their method for resolving parallelism-dependent anaphora and sho... | In previous work we studied a new type of DCGs, Datalog grammars, which are inspired on database theory. Their efficiency was shown to be better than that of their DCG counterparts under (terminating) OLDT-resolution. In this article we motivate a variant of Datalog grammars which allows us a meta-grammatical treatment... |
cmp-lg9505006 | 1617827527 | In previous work we studied a new type of DCGs, Datalog grammars, which are inspired on database theory. Their efficiency was shown to be better than that of their DCG counterparts under (terminating) OLDT-resolution. In this article we motivate a variant of Datalog grammars which allows us a meta-grammatical treatment... | By examining ellipsis in the context of coordinated structures, which are parallel by definition, and by using extended DLGs, we provide a method in which parallel structures are detected and resolved through syntactic and semantic criteria, and which can be applied to either grammars using different semantic represent... | {
"cite_N": [
"@cite_8"
],
"mid": [
"2006589508"
],
"abstract": [
"Logic grammars are grammars expressible in predicate logic. Implemented in the programming language Prolog, logic grammar systems have proved to be a good basis for natural language processing. One of the most difficult constructio... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_8: Logic grammars are grammars expressible in predicate logic. Implemented in the programming language Prolog, logic grammar systems have proved to be a good basis for natural language processing. One of the most difficult... | In previous work we studied a new type of DCGs, Datalog grammars, which are inspired on database theory. Their efficiency was shown to be better than that of their DCG counterparts under (terminating) OLDT-resolution. In this article we motivate a variant of Datalog grammars which allows us a meta-grammatical treatment... |
cmp-lg9505038 | 2952182676 | Augmented reality is a research area that tries to embody an electronic information space within the real world, through computational devices. A crucial issue within this area, is the recognition of real world objects or situations. In natural language processing, it is much easier to determine interpretations of utte... | Ubiquitous computing @cite_4 proposes that very small computational devices (i.e., ubiquitous computers) be embedded and integrated into physical environments in such a way that they operate seamlessly and almost transparently. These devices are aware of their physical surroundings. In contrast to ubiquitous computers,... | {
"cite_N": [
"@cite_4"
],
"mid": [
"2084069552"
],
"abstract": [
"Ubiquitous computing is the method of enhancing computer use by making many computers available throughout the physical environment, but making them effectively invisible to the user. Since we started this work at Xerox PARC in 198... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_4: Ubiquitous computing is the method of enhancing computer use by making many computers available throughout the physical environment, but making them effectively invisible to the user. Since we started this work at Xerox... | Augmented reality is a research area that tries to embody an electronic information space within the real world, through computational devices. A crucial issue within this area, is the recognition of real world objects or situations. In natural language processing, it is much easier to determine interpretations of utte... |
math9702221 | 2117609843 | This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the @math -resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the monomial structure of any given polynomial system. We thus obtain a fast new a... | From an applied angle, our observations on degeneracies and handling polynomial systems with infinitely many roots nicely complement the work of Emiris and Canny @cite_43 . In particular, their sparse resultant based algorithms for polynomial system solving can now be made to work even when problem B occurs. Also, an a... | {
"cite_N": [
"@cite_41",
"@cite_43"
],
"mid": [
"1976392590",
"2066130115"
],
"abstract": [
"Multipolynomial resultants provide the most efficient methods known (in terms as asymptoticcomplexity) for solving certain systems of polynomial equations or eliminating variables (, 1988). The re... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_41: Multipolynomial resultants provide the most efficient methods known (in terms as asymptoticcomplexity) for solving certain systems of polynomial equations or eliminating variables (, 1988). The resultant of f"1, ..., f... | This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the @math -resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the monomial structure of any given polynomial system. We thus obtain a fast new a... |
cmp-lg9503009 | 2951769629 | This paper presents an algorithm for tagging words whose part-of-speech properties are unknown. Unlike previous work, the algorithm categorizes word tokens in context instead of word types. The algorithm is evaluated on the Brown Corpus. | The simplest part-of-speech taggers are bigram or trigram models @cite_12 @cite_1 . They require a relatively large tagged training text. Transformation-based tagging as introduced by also requires a hand-tagged text for training. No pretagged text is necessary for Hidden Markov Models @cite_7 @cite_13 @cite_2 . Still,... | {
"cite_N": [
"@cite_7",
"@cite_1",
"@cite_2",
"@cite_13",
"@cite_12"
],
"mid": [
"2100796029",
"2166394306",
"",
"2046224275",
"1509596266"
],
"abstract": [
"Abstract A system for part-of-speech tagging is described. It is based on a hidden Markov model which can b... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_7: Abstract A system for part-of-speech tagging is described. It is based on a hidden Markov model which can be trained using a corpus of untagged text. Several techniques are introduced to achieve robustness while maintai... | This paper presents an algorithm for tagging words whose part-of-speech properties are unknown. Unlike previous work, the algorithm categorizes word tokens in context instead of word types. The algorithm is evaluated on the Brown Corpus. |
cmp-lg9503009 | 2951769629 | This paper presents an algorithm for tagging words whose part-of-speech properties are unknown. Unlike previous work, the algorithm categorizes word tokens in context instead of word types. The algorithm is evaluated on the Brown Corpus. | The present paper is concerned with tagging languages and sublanguages for which no a priori knowledge about grammatical categories is available, a situation that occurs often in practice @cite_4 . | {
"cite_N": [
"@cite_4"
],
"mid": [
"144990771"
],
"abstract": [
"In this paper, we will discuss a method for assigning part of speech tags to words in an unannotated text corpus whose structure is completely unknown, with a little bit of help from an informant. Starting from scratch, automated an... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_4: In this paper, we will discuss a method for assigning part of speech tags to words in an unannotated text corpus whose structure is completely unknown, with a little bit of help from an informant. Starting from scratch,... | This paper presents an algorithm for tagging words whose part-of-speech properties are unknown. Unlike previous work, the algorithm categorizes word tokens in context instead of word types. The algorithm is evaluated on the Brown Corpus. |
cmp-lg9503009 | 2951769629 | This paper presents an algorithm for tagging words whose part-of-speech properties are unknown. Unlike previous work, the algorithm categorizes word tokens in context instead of word types. The algorithm is evaluated on the Brown Corpus. | In a previous paper @cite_15 , we trained a neural network to disambiguate part-of-speech using context; however, no information about the word that is to be categorized was used. This scheme fails for cases like The soldiers rarely come home.'' vs. The soldiers will come home.'' where the context is identical and info... | {
"cite_N": [
"@cite_15"
],
"mid": [
"2163514362"
],
"abstract": [
"This paper presents a method for inducing the parts of speech of a language and part-of-speech labels for individual words from a large text corpus. Vector representations for the part-of-speech of a word are formed from entries o... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_15: This paper presents a method for inducing the parts of speech of a language and part-of-speech labels for individual words from a large text corpus. Vector representations for the part-of-speech of a word are formed fr... | This paper presents an algorithm for tagging words whose part-of-speech properties are unknown. Unlike previous work, the algorithm categorizes word tokens in context instead of word types. The algorithm is evaluated on the Brown Corpus. |
cmp-lg9607020 | 1497662183 | In this paper, we propose a novel strategy which is designed to enhance the accuracy of the parser by simplifying complex sentences before parsing. This approach involves the separate parsing of the constituent sub-sentences within a complex sentence. To achieve that, the divide-and-conquer strategy first disambiguates... | Magerman discussed the poor performance of his parser SPATTER on sentences with conjunctions @cite_9 . As a result, he augmented SPATTER's probabilistic model with an additional conjunction feature. However, he reported that though SPATTER's performance on conjoined sentences improves with the conjunction feature, a si... | {
"cite_N": [
"@cite_9"
],
"mid": [
"1924403233"
],
"abstract": [
"Traditional natural language parsers are based on rewrite rule systems developed in an arduous, time-consuming manner by grammarians. A majority of the grammarian's efforts are devoted to the disambiguation process, first hypothesi... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_9: Traditional natural language parsers are based on rewrite rule systems developed in an arduous, time-consuming manner by grammarians. A majority of the grammarian's efforts are devoted to the disambiguation process, fir... | In this paper, we propose a novel strategy which is designed to enhance the accuracy of the parser by simplifying complex sentences before parsing. This approach involves the separate parsing of the constituent sub-sentences within a complex sentence. To achieve that, the divide-and-conquer strategy first disambiguates... |
cmp-lg9607020 | 1497662183 | In this paper, we propose a novel strategy which is designed to enhance the accuracy of the parser by simplifying complex sentences before parsing. This approach involves the separate parsing of the constituent sub-sentences within a complex sentence. To achieve that, the divide-and-conquer strategy first disambiguates... | Jones explored another type of link words, the punctuations @cite_7 . He showed successfully that for longer sentences, a grammar which makes use of punctuation massively outperforms one which does not. Besides improving parsing accuracy, the use of punctuations also significantly reduces the number of possible parses ... | {
"cite_N": [
"@cite_7"
],
"mid": [
"2039117335"
],
"abstract": [
"Few, if any, current NLP systems make any significant use of punctuation. Intuitively, a treatment of punctuation seems necessary to the analysis and production of text. Whilst this has been suggested in the fields of discourse str... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_7: Few, if any, current NLP systems make any significant use of punctuation. Intuitively, a treatment of punctuation seems necessary to the analysis and production of text. Whilst this has been suggested in the fields of d... | In this paper, we propose a novel strategy which is designed to enhance the accuracy of the parser by simplifying complex sentences before parsing. This approach involves the separate parsing of the constituent sub-sentences within a complex sentence. To achieve that, the divide-and-conquer strategy first disambiguates... |
1908.11823 | 2970705892 | In this work we investigate to which extent one can recover class probabilities within the empirical risk minimization (ERM) paradigm. The main aim of our paper is to extend existing results and emphasize the tight relations between empirical risk minimization and class probability estimation. Based on existing literat... | perform an analysis similar to ours as they also investigate convergence properties of a class probability estimator, their start and end point are very different though. While we start with theory from proper scoring rules, their paper directly starts with the class probability estimator as found in @cite_5 . The prob... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2023163512"
],
"abstract": [
"We study how closely the optimal Bayes error rate can be approximately reached using a classification algorithm that computes a classifier by minimizing a convex upper bound of the classification error function. The measurement of ... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_5: We study how closely the optimal Bayes error rate can be approximately reached using a classification algorithm that computes a classifier by minimizing a convex upper bound of the classification error function. The mea... | In this work we investigate to which extent one can recover class probabilities within the empirical risk minimization (ERM) paradigm. The main aim of our paper is to extend existing results and emphasize the tight relations between empirical risk minimization and class probability estimation. Based on existing literat... |
1908.11823 | 2970705892 | In this work we investigate to which extent one can recover class probabilities within the empirical risk minimization (ERM) paradigm. The main aim of our paper is to extend existing results and emphasize the tight relations between empirical risk minimization and class probability estimation. Based on existing literat... | The probability estimator we use also appears in @cite_10 where it is used to derive excess risk bounds, referred to as surrogate risk bounds, for bipartite ranking. The methods used are very similar in the sense that these are also based on proper scoring rules. The difference is again the focus, and even more so the ... | {
"cite_N": [
"@cite_10"
],
"mid": [
"2141789531"
],
"abstract": [
"The problem of bipartite ranking, where instances are labeled positive or negative and the goal is to learn a scoring function that minimizes the probability of mis-ranking a pair of positive and negative instances (or equivalentl... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_10: The problem of bipartite ranking, where instances are labeled positive or negative and the goal is to learn a scoring function that minimizes the probability of mis-ranking a pair of positive and negative instances (or... | In this work we investigate to which extent one can recover class probabilities within the empirical risk minimization (ERM) paradigm. The main aim of our paper is to extend existing results and emphasize the tight relations between empirical risk minimization and class probability estimation. Based on existing literat... |
1908.11829 | 2970633507 | We consider the minimum cut problem in undirected, weighted graphs. We give a simple algorithm to find a minimum cut that @math -respects (cuts two edges of) a spanning tree @math of a graph @math . This procedure can be used in place of the complicated subroutine given in Karger's near-linear time minimum cut algorith... | On an unweighted graph, Gabow @cite_13 showed how to compute the minimum cut in @math time, where @math is the capacity of the minimum cut. Karger @cite_29 improved Gabow's algorithm by applying random sampling, achieving runtime @math The @math notation hides @math factors. Las Vegas. The sampling technique developed ... | {
"cite_N": [
"@cite_29",
"@cite_16",
"@cite_13"
],
"mid": [
"2150516767",
"1964510837",
"2012287357"
],
"abstract": [
"We use random sampling as a tool for solving undirected graph problems. We show that the sparse graph, or skeleton, that arises when we randomly sample a graph's ... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_29: We use random sampling as a tool for solving undirected graph problems. We show that the sparse graph, or skeleton, that arises when we randomly sample a graph's edges will accurately approximate the value of all cuts ... | We consider the minimum cut problem in undirected, weighted graphs. We give a simple algorithm to find a minimum cut that @math -respects (cuts two edges of) a spanning tree @math of a graph @math . This procedure can be used in place of the complicated subroutine given in Karger's near-linear time minimum cut algorith... |
1908.11829 | 2970633507 | We consider the minimum cut problem in undirected, weighted graphs. We give a simple algorithm to find a minimum cut that @math -respects (cuts two edges of) a spanning tree @math of a graph @math . This procedure can be used in place of the complicated subroutine given in Karger's near-linear time minimum cut algorith... | A recent development uses low-conductance cuts to find the minimum cut in an undirected unweighted graph. This technique was introduced by Kawarabayashi and Thorup @cite_2 , who achieve near-linear deterministic time (estimated to be @math ). This was improved by Henzinger, Rao, and Wang @cite_31 , who achieve determin... | {
"cite_N": [
"@cite_31",
"@cite_16",
"@cite_2"
],
"mid": [
"2569104968",
"1964510837",
"2963972775"
],
"abstract": [
"We study the problem of computing a minimum cut in a simple, undirected graph and give a deterministic O(m log2 n log log2 n) time algorithm. This improves both on... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_31: We study the problem of computing a minimum cut in a simple, undirected graph and give a deterministic O(m log2 n log log2 n) time algorithm. This improves both on the best previously known deterministic running time o... | We consider the minimum cut problem in undirected, weighted graphs. We give a simple algorithm to find a minimum cut that @math -respects (cuts two edges of) a spanning tree @math of a graph @math . This procedure can be used in place of the complicated subroutine given in Karger's near-linear time minimum cut algorith... |
1908.11656 | 2971124296 | We propose LU-Net -- for LiDAR U-Net, a new method for the semantic segmentation of a 3D LiDAR point cloud. Instead of applying some global 3D segmentation method such as PointNet, we propose an end-to-end architecture for LiDAR point cloud semantic segmentation that efficiently solves the problem as an image processin... | Semantic segmentation of images has been the subject of many works in the past years. Recently, deep learning methods have largely outperformed previous ones. The method presented in @cite_16 was the first to propose an accurate end-to-end network for semantic segmentation. This method is based on an encoder in which e... | {
"cite_N": [
"@cite_7",
"@cite_1",
"@cite_15",
"@cite_16",
"@cite_20",
"@cite_11"
],
"mid": [
"2611259176",
"2898743055",
"2563705555",
"1903029394",
"1901129140",
"2964309882"
],
"abstract": [
"We focus on the challenging task of real-time semantic segment... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_7: We focus on the challenging task of real-time semantic segmentation in this paper. It finds many practical applications and yet is with fundamental difficulty of reducing a large portion of computation for pixel-wise la... | We propose LU-Net -- for LiDAR U-Net, a new method for the semantic segmentation of a 3D LiDAR point cloud. Instead of applying some global 3D segmentation method such as PointNet, we propose an end-to-end architecture for LiDAR point cloud semantic segmentation that efficiently solves the problem as an image processin... |
1908.11656 | 2971124296 | We propose LU-Net -- for LiDAR U-Net, a new method for the semantic segmentation of a 3D LiDAR point cloud. Instead of applying some global 3D segmentation method such as PointNet, we propose an end-to-end architecture for LiDAR point cloud semantic segmentation that efficiently solves the problem as an image processin... | Recently, SqueezeSeg, a novel approach for the semantic segmentation of a LiDAR point cloud represented as a spherical range-image @cite_14 , was proposed. This representation allows to perform the segmentation by using simple 2D convolutions, which lowers the computational cost while keeping good accuracy. The archite... | {
"cite_N": [
"@cite_14",
"@cite_4",
"@cite_8",
"@cite_10",
"@cite_3",
"@cite_13",
"@cite_20",
"@cite_17"
],
"mid": [
"",
"2412782625",
"",
"2946747865",
"2968557240",
"2279098554",
"1901129140",
"2884355388"
],
"abstract": [
"",
"In this... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_14:
@cite_4: In this work we address the task of semantic image segmentation with Deep Learning and make three main contributions that are experimentally shown to have substantial practical merit. First , we highlight co... | We propose LU-Net -- for LiDAR U-Net, a new method for the semantic segmentation of a 3D LiDAR point cloud. Instead of applying some global 3D segmentation method such as PointNet, we propose an end-to-end architecture for LiDAR point cloud semantic segmentation that efficiently solves the problem as an image processin... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | Several temporal logics have been proposed that make joint use of actions and propositions on states: ACTL* @cite_34 , RLTL @cite_0 , SE-LTL @cite_4 , TLR* @cite_25 . There are also transition structures with mixed ingredients: LKS @cite_4 , L2TS @cite_54 . Although all of them bring actions (or transitions) to the foc... | {
"cite_N": [
"@cite_4",
"@cite_54",
"@cite_0",
"@cite_34",
"@cite_25"
],
"mid": [
"",
"2167352300",
"2024215898",
"1602925513",
"1599831144"
],
"abstract": [
"",
"Three temporal logics are introduced which induce on labeled transition systems the same identific... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_4:
@cite_54: Three temporal logics are introduced which induce on labeled transition systems the same identifications as branching bisimulation. The first is an extension of Hennessy-Milner logic with a kind of unit oper... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | The best move towards egalitarianism we know of is the temporal logic of rewriting, TLR* (which was an inspiration for the present work). The explanations and examples in @cite_25 are good arguments for an egalitarian view. Consider this formula to express fairness in the execution of a rule with label @math : @math . ... | {
"cite_N": [
"@cite_25"
],
"mid": [
"1599831144"
],
"abstract": [
"This paper presents the temporal logic of rewriting @math . Syntactically, @math is a very simple extension of @math which just adds action atoms, in the form of spatial action patterns, to @math . Semantically and pragmatically, ... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_25: This paper presents the temporal logic of rewriting @math . Syntactically, @math is a very simple extension of @math which just adds action atoms, in the form of spatial action patterns, to @math . Semantically and pra... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | Plain TLR*, as described in @cite_25 , stays a step away from our goal, because transitions are given by proof terms, that univocally determine one origin state and one destination state for each transition. TLR* uses proof-term patterns (called ), that are used literally in temporal formulas. The problem is that, in t... | {
"cite_N": [
"@cite_14",
"@cite_36",
"@cite_9",
"@cite_51",
"@cite_25"
],
"mid": [
"1986424898",
"1583068981",
"",
"2151284417",
"1599831144"
],
"abstract": [
"This paper presents the linear temporal logic of rewriting (LTLR) model checker under localized fairness ... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_14: This paper presents the linear temporal logic of rewriting (LTLR) model checker under localized fairness assumptions for the Maude system. The linear temporal logic of rewriting extends linear temporal logic (LTL) with... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | Our paper @cite_5 contains a first definition of the synchronous composition of rewrite systems. There, we proposed to synchronise the execution of rules from different systems based on the coincidence of (atomic) rule labels. This reflects the synchronisation of actions in process algebras and in automata, for example... | {
"cite_N": [
"@cite_5",
"@cite_33"
],
"mid": [
"2521108378",
"2890370072"
],
"abstract": [
"We present a concept of module composition for rewrite systems that we call synchronous product, and also a corresponding concept for doubly labeled transition systems (as proposed by De Nicola and... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_5: We present a concept of module composition for rewrite systems that we call synchronous product, and also a corresponding concept for doubly labeled transition systems (as proposed by De Nicola and Vaandrager) used as s... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | In a different topic, the paper @cite_33 also describes the use of parameterised programming to add encapsulation to our setting. We have already mentioned it in . We outline it roughly refering to the example from , on two controlled trains. First, a so-called theory is used to state that a train is any system that de... | {
"cite_N": [
"@cite_33"
],
"mid": [
"2890370072"
],
"abstract": [
"Our overall goal is compositional specification and verification in rewriting logic. In previous work, we described a way to compose system specifications using the operation we call synchronous composition. In this paper, we prop... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_33: Our overall goal is compositional specification and verification in rewriting logic. In previous work, we described a way to compose system specifications using the operation we call synchronous composition. In this pa... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | Process algebras were initially designed as theoretical tools. They focus on actions and synchronisation, and do not provide any means to specify internal computations, or to handle complex data types. However, later developments have taken process algebras as a basis for practical modelling and verification tools. Exa... | {
"cite_N": [
"@cite_18",
"@cite_19",
"@cite_27",
"@cite_45",
"@cite_49"
],
"mid": [
"24701999",
"2110425399",
"1532163655",
"1995830301",
"2757839910"
],
"abstract": [
"SCEL (Service Component Ensemble Language) is a new language specifically designed to rigorously... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_18: SCEL (Service Component Ensemble Language) is a new language specifically designed to rigorously model and program autonomic components and their interaction, while supporting formal reasoning on their behaviors. SCEL ... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | Typically, there are two ways to compose Petri nets. One is given by hierarchical nets, that is, nets in which a transition can represent a complete separate net, that is described independently. The second way is to identify, or , either places or transitions from two different nets. For example, the coffee machine an... | {
"cite_N": [
"@cite_29"
],
"mid": [
"2016355163"
],
"abstract": [
"A quite fourishing research thread in the recent literature on component based system is concerned with the algebraic properties of different classes of connectors. In a recent paper, an algebra of stateless connectors was present... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_29: A quite fourishing research thread in the recent literature on component based system is concerned with the algebraic properties of different classes of connectors. In a recent paper, an algebra of stateless connectors... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | Tile logic was introduced in @cite_28 , and is closely related to rewriting logic. In short, tile logic is rewriting logic with side effects for composition. A tile is written as @math with @math being the condition for, and @math the effect of, rewriting @math to @math . The intuitive meaning of that tile is: the term... | {
"cite_N": [
"@cite_28"
],
"mid": [
"1909063750"
],
"abstract": [
"In this paper we introduce a model for a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting, in particular from the r... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_28: In this paper we introduce a model for a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting, in particula... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | Connections between tile logic and rewriting logic have been drawn in @cite_47 and @cite_39 , mainly in the language of category theory. | {
"cite_N": [
"@cite_47",
"@cite_39"
],
"mid": [
"1601458080",
"2026741712"
],
"abstract": [
"Rewriting logic extends to concurrent systems with state changes the body of theory developed within the algebraic semantics approach. It is both a foundational tool and the kernel language of sev... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_47: Rewriting logic extends to concurrent systems with state changes the body of theory developed within the algebraic semantics approach. It is both a foundational tool and the kernel language of several implementation ef... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | The goal of coordination is to make different components work together. The components may have been coded in different languages, reside in different servers, with different architectures. The paper @cite_20 is a comprehensive reference, though old. | {
"cite_N": [
"@cite_20"
],
"mid": [
"1500859230"
],
"abstract": [
"A new class of models, formalisms and mechanisms has recently evolved for describing concurrent and distributed computations based on the concept of coordination''''. The purpose of a coordination model and associated language is ... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_20: A new class of models, formalisms and mechanisms has recently evolved for describing concurrent and distributed computations based on the concept of coordination''''. The purpose of a coordination model and associated ... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | Coordination is a very general term, and some of the proposals we have discussed above can be seen as belonging to it. Let us name a few additional examples. Linda, with all its variants and implementations, is one of the best known coordination languages. See @cite_35 for a relatively recent take. It is based on the i... | {
"cite_N": [
"@cite_44",
"@cite_35"
],
"mid": [
"2139842876",
"28813266"
],
"abstract": [
"In this paper, we present Reo, which forms a paradigm for composition of software components based on the notion of mobile channels. Reo is a channel-based exogenous coordination model in which comp... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_44: In this paper, we present Reo, which forms a paradigm for composition of software components based on the notion of mobile channels. Reo is a channel-based exogenous coordination model in which complex coordinators, ca... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11769 | 2971290534 | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... | BIP stands for , , ---the three of a composed specification, as proposed by the authors. The behaviour of atomic components is specified by automata (of a special kind) some of whose actions are also taken as port names for communication. These automata are a specification of requirements on the component, whose real i... | {
"cite_N": [
"@cite_17"
],
"mid": [
"2133038101"
],
"abstract": [
"We present a methodology for modeling heterogeneous real-time components. Components are obtained as the superposition of three layers : Behavior, specified as a set of transitions; Interactions between transitions of the behavior... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_17: We present a methodology for modeling heterogeneous real-time components. Components are obtained as the superposition of three layers : Behavior, specified as a set of transitions; Interactions between transitions of ... | Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and... |
1908.11645 | 2971105318 | In the wake of the success of convolutional neural networks in image classification, object recognition, speech recognition, etc., the demand for deploying these compute-intensive ML models on embedded and mobile systems with tight power and energy constraints at low cost, as well as for boosting throughput in data cen... | There are several methods out there describing hardware accelerators which exploit feature map sparsity to reduce computation: Cnvlutin @cite_2 , SCNN @cite_47 , Cambricon-X @cite_46 , NullHop @cite_24 , Eyeriss @cite_12 , EIE @cite_43 . Their focus is on power gating or skipping some of the operations and memory acces... | {
"cite_N": [
"@cite_47",
"@cite_24",
"@cite_43",
"@cite_2",
"@cite_46",
"@cite_12"
],
"mid": [
"2625457103",
"2623629680",
"2285660444",
"2516141709",
"2565851976",
"2442974303"
],
"abstract": [
"Convolutional Neural Networks (CNNs) have emerged as a fundam... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_47: Convolutional Neural Networks (CNNs) have emerged as a fundamental technology for machine learning. High performance and extreme energy efficiency are critical for deployments of CNNs, especially in mobile platforms su... | In the wake of the success of convolutional neural networks in image classification, object recognition, speech recognition, etc., the demand for deploying these compute-intensive ML models on embedded and mobile systems with tight power and energy constraints at low cost, as well as for boosting throughput in data cen... |
1908.11645 | 2971105318 | In the wake of the success of convolutional neural networks in image classification, object recognition, speech recognition, etc., the demand for deploying these compute-intensive ML models on embedded and mobile systems with tight power and energy constraints at low cost, as well as for boosting throughput in data cen... | Oher compression methods are focusing on minimizing the model size and are very complex (silicon area) to implement in hardware. One such method, deep compression @cite_48 , combines pruning, trained clustering-based quantization, and Huffman coding. Most of these steps cannot be applied to the intermediate feature map... | {
"cite_N": [
"@cite_38",
"@cite_48",
"@cite_42",
"@cite_0",
"@cite_10"
],
"mid": [
"1990653637",
"2964299589",
"2122962290",
"2162310490",
"2487148512"
],
"abstract": [
"",
"Abstract: Neural networks are both computationally intensive and memory intensive, maki... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_38:
@cite_48: Abstract: Neural networks are both computationally intensive and memory intensive, making them difficult to deploy on embedded systems with limited hardware resources. To address this limitation, we introdu... | In the wake of the success of convolutional neural networks in image classification, object recognition, speech recognition, etc., the demand for deploying these compute-intensive ML models on embedded and mobile systems with tight power and energy constraints at low cost, as well as for boosting throughput in data cen... |
1908.11645 | 2971105318 | In the wake of the success of convolutional neural networks in image classification, object recognition, speech recognition, etc., the demand for deploying these compute-intensive ML models on embedded and mobile systems with tight power and energy constraints at low cost, as well as for boosting throughput in data cen... | Few more methods exist by changing the CNN's structure in order to compress the weights @cite_14 @cite_37 or the feature maps @cite_1 @cite_50 @cite_18 . However, they require altering the CNN's model and or retraining, and they introduce some accuracy loss. Furthermore, they can only be used to compress a few feature ... | {
"cite_N": [
"@cite_18",
"@cite_37",
"@cite_14",
"@cite_1",
"@cite_50"
],
"mid": [
"2946521496",
"2732044853",
"2172166488",
"2787697768",
"2741232386"
],
"abstract": [
"We present a theoretical and experimental investigation of the quantization problem for artific... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_18: We present a theoretical and experimental investigation of the quantization problem for artificial neural networks. We provide a mathematical definition of quantized neural networks and analyze their approximation capa... | In the wake of the success of convolutional neural networks in image classification, object recognition, speech recognition, etc., the demand for deploying these compute-intensive ML models on embedded and mobile systems with tight power and energy constraints at low cost, as well as for boosting throughput in data cen... |
1908.11645 | 2971105318 | In the wake of the success of convolutional neural networks in image classification, object recognition, speech recognition, etc., the demand for deploying these compute-intensive ML models on embedded and mobile systems with tight power and energy constraints at low cost, as well as for boosting throughput in data cen... | The most directly comparable approach, cDMA @cite_25 , describes a hardware-friendly compression scheme to reduce the data size of intermediate feature maps. Their target application differs in that their main goal is to allow faster temporary offloading of the feature maps from GPU to CPU memory through the PCIe bandw... | {
"cite_N": [
"@cite_25"
],
"mid": [
"2962821792"
],
"abstract": [
"Popular deep learning frameworks require users to fine-tune their memory usage so that the training data of a deep neural network (DNN) fits within the GPU physical memory. Prior work tries to address this restriction by virtualiz... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_25: Popular deep learning frameworks require users to fine-tune their memory usage so that the training data of a deep neural network (DNN) fits within the GPU physical memory. Prior work tries to address this restriction ... | In the wake of the success of convolutional neural networks in image classification, object recognition, speech recognition, etc., the demand for deploying these compute-intensive ML models on embedded and mobile systems with tight power and energy constraints at low cost, as well as for boosting throughput in data cen... |
1908.11645 | 2971105318 | In the wake of the success of convolutional neural networks in image classification, object recognition, speech recognition, etc., the demand for deploying these compute-intensive ML models on embedded and mobile systems with tight power and energy constraints at low cost, as well as for boosting throughput in data cen... | For this work, we build on a method known in the area of texture compression for GPUs, @cite_44 , fuse it with sparsity-focused compression methods, and evaluate the resulting compression algorithm on intermediate feature maps and gradient maps to show compression ratios of 5.1 (8 ,bit AlexNet), 4 (VGG-16), 2.4 (ResNet... | {
"cite_N": [
"@cite_44"
],
"mid": [
"2516109628"
],
"abstract": [
"As key applications become more data-intensive and the computational throughput of processors increases, the amount of data to be transferred in modern memory subsystems grows. Increasing physical bandwidth to keep up with the dem... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_44: As key applications become more data-intensive and the computational throughput of processors increases, the amount of data to be transferred in modern memory subsystems grows. Increasing physical bandwidth to keep up ... | In the wake of the success of convolutional neural networks in image classification, object recognition, speech recognition, etc., the demand for deploying these compute-intensive ML models on embedded and mobile systems with tight power and energy constraints at low cost, as well as for boosting throughput in data cen... |
1908.11787 | 2970281864 | We present a novel approach to answering sequential questions based on structured objects such as knowledge bases or tables without using a logical form as an intermediate representation. We encode tables as graphs using a graph neural network model based on the Transformer architecture. The answers are then selected f... | Semantic parsing models can be trained to produce gold logical forms using an encoder-decoder approach @cite_26 or by filling templates @cite_22 @cite_18 @cite_30 . When gold logical forms are not available, they are typically treated as latent variables or hidden states and the answers or denotations are used to searc... | {
"cite_N": [
"@cite_30",
"@cite_18",
"@cite_26",
"@cite_22",
"@cite_7",
"@cite_29",
"@cite_32",
"@cite_6",
"@cite_16",
"@cite_5",
"@cite_31",
"@cite_34"
],
"mid": [
"",
"",
"2963868320",
"2768409085",
"2891000242",
"",
"2891991579",
... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_30:
@cite_18:
@cite_26:
@cite_22: Synthesizing SQL queries from natural language is a long-standing open problem and has been attracting considerable interest recently. Toward solving the problem, the de facto approa... | We present a novel approach to answering sequential questions based on structured objects such as knowledge bases or tables without using a logical form as an intermediate representation. We encode tables as graphs using a graph neural network model based on the Transformer architecture. The answers are then selected f... |
1908.11598 | 2971001703 | We consider a crowdsourcing data acquisition scenario, such as federated learning, where a Center collects data points from a set of rational Agents, with the aim of training a model. For linear regression models, we show how a payment structure can be designed to incentivize the agents to provide high-quality data as ... | The topic of learning a model when the input data points are provided by strategic sources has been the focus of a growing literature at the intersection of machine learning and game theory. A significant amount of work has been devoted to the setting in which Agents are interested in the outcome of the estimation proc... | {
"cite_N": [
"@cite_14",
"@cite_9",
"@cite_21",
"@cite_19",
"@cite_2",
"@cite_5",
"@cite_15"
],
"mid": [
"1983916796",
"2435502378",
"2110135769",
"2767657742",
"2962877736",
"2054844093",
"2963668529"
],
"abstract": [
"We initiate the study of ince... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_14: We initiate the study of incentives in a general machine learning framework. We focus on a game-theoretic regression learning setting where private information is elicited from multiple agents with different, possibly ... | We consider a crowdsourcing data acquisition scenario, such as federated learning, where a Center collects data points from a set of rational Agents, with the aim of training a model. For linear regression models, we show how a payment structure can be designed to incentivize the agents to provide high-quality data as ... |
1908.11598 | 2971001703 | We consider a crowdsourcing data acquisition scenario, such as federated learning, where a Center collects data points from a set of rational Agents, with the aim of training a model. For linear regression models, we show how a payment structure can be designed to incentivize the agents to provide high-quality data as ... | Our ideas are closely related to the literature of mechanisms @cite_8 and @cite_17 . The idea behind this literature is to extract high-quality information from individuals by comparing their reports against those of randomly chosen peers. This approach has been largely successful in eliciting information. The same pri... | {
"cite_N": [
"@cite_1",
"@cite_17",
"@cite_8"
],
"mid": [
"2597603852",
"2267283990",
"2757853533"
],
"abstract": [
"How can we explain the predictions of a black-box model? In this paper, we use influence functions — a classic technique from robust statistics — to trace a model's... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_1: How can we explain the predictions of a black-box model? In this paper, we use influence functions — a classic technique from robust statistics — to trace a model's prediction through the learning algorithm and back to ... | We consider a crowdsourcing data acquisition scenario, such as federated learning, where a Center collects data points from a set of rational Agents, with the aim of training a model. For linear regression models, we show how a payment structure can be designed to incentivize the agents to provide high-quality data as ... |
1908.11515 | 2970190087 | When collecting information, local differential privacy (LDP) alleviates privacy concerns of users, as users' private information is randomized before being sent to the central aggregator. However, LDP results in loss of utility due to the amount of noise that is added. To address this issue, recent work introduced an ... | Frequency Oracle One basic mechanism in LDP is to estimate frequencies of values. There have been several mechanisms @cite_34 @cite_30 @cite_2 @cite_31 @cite_5 @cite_0 proposed for this task. Among them, @cite_31 introduces , which achieves low estimation errors and low communication costs. The application of is crucia... | {
"cite_N": [
"@cite_30",
"@cite_4",
"@cite_0",
"@cite_2",
"@cite_5",
"@cite_31",
"@cite_34",
"@cite_11"
],
"mid": [
"1986293063",
"2532967691",
"2964010583",
"2734833749",
"",
"2742225091",
"1981029888",
""
],
"abstract": [
"We give efficien... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_30: We give efficient protocols and matching accuracy lower bounds for frequency estimation in the local model for differential privacy. In this model, individual users randomize their data themselves, sending differential... | When collecting information, local differential privacy (LDP) alleviates privacy concerns of users, as users' private information is randomized before being sent to the central aggregator. However, LDP results in loss of utility due to the amount of noise that is added. To address this issue, recent work introduced an ... |
1908.11515 | 2970190087 | When collecting information, local differential privacy (LDP) alleviates privacy concerns of users, as users' private information is randomized before being sent to the central aggregator. However, LDP results in loss of utility due to the amount of noise that is added. To address this issue, recent work introduced an ... | There also exist relaxed models that seem incompatible with the shuffler model, i.e., @cite_15 considers the inferring probability as the adversary's power; and @cite_3 utilizes the linkage between each user's sensitive and public attributes. | {
"cite_N": [
"@cite_15",
"@cite_3"
],
"mid": [
"2902114605",
"2948055046"
],
"abstract": [
"In large-scale statistical learning, data collection and model fitting are moving increasingly toward peripheral devices---phones, watches, fitness trackers---away from centralized data collection.... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_15: In large-scale statistical learning, data collection and model fitting are moving increasingly toward peripheral devices---phones, watches, fitness trackers---away from centralized data collection. Concomitant with thi... | When collecting information, local differential privacy (LDP) alleviates privacy concerns of users, as users' private information is randomized before being sent to the central aggregator. However, LDP results in loss of utility due to the amount of noise that is added. To address this issue, recent work introduced an ... |
1908.11515 | 2970190087 | When collecting information, local differential privacy (LDP) alleviates privacy concerns of users, as users' private information is randomized before being sent to the central aggregator. However, LDP results in loss of utility due to the amount of noise that is added. To address this issue, recent work introduced an ... | Distributed DP In the distributed setting of DP, each data owner (or proxy) has access to a (disjoint) subset of users. For example, each patient's information is possessed by a hospital. The DP noise is added at the level of the intermediate data owners (e.g., @cite_27 ). A special case (two-party computation) is also... | {
"cite_N": [
"@cite_18",
"@cite_37",
"@cite_7",
"@cite_27",
"@cite_16",
"@cite_10"
],
"mid": [
"2751501713",
"1493407996",
"2029905190",
"",
"2610910029",
"2943322967"
],
"abstract": [
"Private record linkage (PRL) is the problem of identifying pairs of rec... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_18: Private record linkage (PRL) is the problem of identifying pairs of records that are similar as per an input matching rule from databases held by two parties that do not trust one another. We identify three key desider... | When collecting information, local differential privacy (LDP) alleviates privacy concerns of users, as users' private information is randomized before being sent to the central aggregator. However, LDP results in loss of utility due to the amount of noise that is added. To address this issue, recent work introduced an ... |
1908.11515 | 2970190087 | When collecting information, local differential privacy (LDP) alleviates privacy concerns of users, as users' private information is randomized before being sent to the central aggregator. However, LDP results in loss of utility due to the amount of noise that is added. To address this issue, recent work introduced an ... | DP by Trusted Hardware In this approach, a trusted hardware (e.g., SGX) is utilized to collect data, tally the data, and add the noise within the protected hardware. The result is then sent to the analyst. Google propose Prochlo @cite_29 that uses SGX. Note that the trusted hardware can be run by the server. Thus @cite... | {
"cite_N": [
"@cite_38",
"@cite_29",
"@cite_1",
"@cite_23"
],
"mid": [
"2795267922",
"2761138375",
"2809701319",
"2889224812"
],
"abstract": [
"It is well-known that a program's memory access pattern can leak information about its input. To thwart such leakage, most existi... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_38: It is well-known that a program's memory access pattern can leak information about its input. To thwart such leakage, most existing works adopt the technique of oblivious RAM (ORAM) simulation. Such an obliviousness no... | When collecting information, local differential privacy (LDP) alleviates privacy concerns of users, as users' private information is randomized before being sent to the central aggregator. However, LDP results in loss of utility due to the amount of noise that is added. To address this issue, recent work introduced an ... |
1908.11515 | 2970190087 | When collecting information, local differential privacy (LDP) alleviates privacy concerns of users, as users' private information is randomized before being sent to the central aggregator. However, LDP results in loss of utility due to the amount of noise that is added. To address this issue, recent work introduced an ... | Aggregation using Secure Computation Our work shares similar threat models from work on secure aggregation such as the electronic voting @cite_12 and statistic aggregation @cite_25 . In particular, multiple users compute some information collaboratively without leaking information about their own data. Note that the pr... | {
"cite_N": [
"@cite_25",
"@cite_12"
],
"mid": [
"2599930814",
"2128227627"
],
"abstract": [
"This paper presents Prio, a privacy-preserving system for the collection of aggregate statistics. Each Prio client holds a private data value (e.g., its current location), and a small set of serve... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_25: This paper presents Prio, a privacy-preserving system for the collection of aggregate statistics. Each Prio client holds a private data value (e.g., its current location), and a small set of servers compute statistical... | When collecting information, local differential privacy (LDP) alleviates privacy concerns of users, as users' private information is randomized before being sent to the central aggregator. However, LDP results in loss of utility due to the amount of noise that is added. To address this issue, recent work introduced an ... |
1908.11421 | 2970918254 | Incorporating Item Response Theory (IRT) into NLP tasks can provide valuable information about model performance and behavior. Traditionally, IRT models are learned using human response pattern (RP) data, presenting a significant bottleneck for large data sets like those required for training deep neural networks (DNNs... | There have been a number of studies on modeling latent traits of data to identify a correct label, [e.g.][] bruce1999recognizing . There has also been work in modeling individuals to identify poor annotators @cite_35 , but neither jointly model the ability of individuals and data points, nor apply the resulting metrics... | {
"cite_N": [
"@cite_30",
"@cite_35",
"@cite_15",
"@cite_2"
],
"mid": [
"2105268242",
"2251818274",
"9014458",
"2295951612"
],
"abstract": [
"We propose a new probabilistic graphical model that jointly models the difficulties of questions, the abilities of participants and ... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_30: We propose a new probabilistic graphical model that jointly models the difficulties of questions, the abilities of participants and the correct answers to questions in aptitude testing and crowdsourcing settings. We de... | Incorporating Item Response Theory (IRT) into NLP tasks can provide valuable information about model performance and behavior. Traditionally, IRT models are learned using human response pattern (RP) data, presenting a significant bottleneck for large data sets like those required for training deep neural networks (DNNs... |
1908.11421 | 2970918254 | Incorporating Item Response Theory (IRT) into NLP tasks can provide valuable information about model performance and behavior. Traditionally, IRT models are learned using human response pattern (RP) data, presenting a significant bottleneck for large data sets like those required for training deep neural networks (DNNs... | There are several other areas of study regarding how best to use training data that are related to this work. Re-weighting or re-ordering training examples is a well-studied and related area of supervised learning. Often examples are re-weighted according to some notion of difficulty, or model uncertainty @cite_24 . In... | {
"cite_N": [
"@cite_24"
],
"mid": [
"2963476860"
],
"abstract": [
"Self-paced learning and hard example mining re-weight training instances to improve learning accuracy. This paper presents two improved alternatives based on lightweight estimates of sample uncertainty in stochastic gradient desce... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_24: Self-paced learning and hard example mining re-weight training instances to improve learning accuracy. This paper presents two improved alternatives based on lightweight estimates of sample uncertainty in stochastic gr... | Incorporating Item Response Theory (IRT) into NLP tasks can provide valuable information about model performance and behavior. Traditionally, IRT models are learned using human response pattern (RP) data, presenting a significant bottleneck for large data sets like those required for training deep neural networks (DNNs... |
1908.11402 | 2970866601 | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... | For the deterministic setting a lot of effort has been dedicated to the study of the feasibility of rendezvous, and to the time required to achieve this task, when feasible. For instance, deterministic rendezvous with agents equipped with tokens used to mark nodes was considered, e.g., in @cite_28 . Deterministic rende... | {
"cite_N": [
"@cite_28",
"@cite_9",
"@cite_17"
],
"mid": [
"2131887891",
"2623545498",
""
],
"abstract": [
"In the rendezvous search problem, two mobile agents must move along the n nodes of a network so as to minimize the time required to meet or rendezvous. When the mobile agent... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_28: In the rendezvous search problem, two mobile agents must move along the n nodes of a network so as to minimize the time required to meet or rendezvous. When the mobile agents are identical and the network is anonymous,... | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... |
1908.11402 | 2970866601 | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... | Memory required by two anonymous agents to achieve deterministic rendezvous has been studied in @cite_22 for trees and in @cite_0 for general graphs. Memory needed for randomized rendezvous in the ring is discussed, e.g., in @cite_25 . | {
"cite_N": [
"@cite_0",
"@cite_25",
"@cite_22"
],
"mid": [
"1972775782",
"1535538796",
"2081055073"
],
"abstract": [
"Two identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. ... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_0: Two identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, bot... | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... |
1908.11402 | 2970866601 | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... | Apart from the synchronous model used in this paper, several authors have investigated asynchronous gathering in the plane @cite_34 @cite_35 and in network environments @cite_19 @cite_1 @cite_30 @cite_13 . In the latter scenario the agent chooses the edge which it decides to traverse but the adversary controls the spee... | {
"cite_N": [
"@cite_30",
"@cite_35",
"@cite_1",
"@cite_19",
"@cite_34",
"@cite_13"
],
"mid": [
"2050063944",
"1635699204",
"2100580556",
"1493636406",
"2087073465",
"1582826078"
],
"abstract": [
"Two mobile agents (robots) having distinct labels and located... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_30: Two mobile agents (robots) having distinct labels and located in nodes of an unknown anonymous connected graph have to meet. We consider the asynchronous version of this well-studied rendezvous problem and we seek fast... | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... |
1908.11402 | 2970866601 | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... | A different asynchronous model for gathering in ring networks was considered in @cite_36 @cite_20 . In this model, agents were memoryless but they could perform look operations which gave them a snapshot of the entire network with the positions of all agents in it. | {
"cite_N": [
"@cite_36",
"@cite_20"
],
"mid": [
"2400422553",
"2144182788"
],
"abstract": [
"Consider a set of mobile robots placed on distinct nodes of a discrete, anonymous, and bidirectional ring. Asynchronously, each robot takes a snapshot of the ring, determining the size of the ring... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_36: Consider a set of mobile robots placed on distinct nodes of a discrete, anonymous, and bidirectional ring. Asynchronously, each robot takes a snapshot of the ring, determining the size of the ring and which nodes are e... | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... |
1908.11402 | 2970866601 | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... | In @cite_32 , the authors considered the problem of network exploration by many agents that could not communicate between them. However, the information available to an agent in each round was much different than in the present paper. Indeed, in @cite_32 , agents were getting local traffic reports consisting of answers... | {
"cite_N": [
"@cite_32"
],
"mid": [
"2089187143"
],
"abstract": [
"A team consisting of an unknown number of mobile agents starting from different nodes of an unknown network, possibly at different times, have to explore the network: Every node must be visited by at least one agent, and all agent... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_32: A team consisting of an unknown number of mobile agents starting from different nodes of an unknown network, possibly at different times, have to explore the network: Every node must be visited by at least one agent, a... | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... |
1908.11402 | 2970866601 | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... | In @cite_5 , the problem of conveying bits of information using movements of robots was considered in a context much different from ours. Mobile robots were moving in the plane and they could periodically get snapshots of the entire configuration of robots. | {
"cite_N": [
"@cite_5"
],
"mid": [
"2944251479"
],
"abstract": [
"We investigate avenues for the exchange of information (explicit communication) among deaf and dumb mobile robots scattered in the plane. We introduce the use of movement-signals (analogously to flight signals and bees waggle) as a... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_5: We investigate avenues for the exchange of information (explicit communication) among deaf and dumb mobile robots scattered in the plane. We introduce the use of movement-signals (analogously to flight signals and bees ... | A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along links of the network. The above task is known as gathering and was traditionally ... |
1908.11526 | 2970961333 | The success of existing deep-learning based multi-view stereo (MVS) approaches greatly depends on the availability of large-scale supervision in the form of dense depth maps. Such supervision, while not always possible, tends to hinder the generalization ability of the learned models in never-seen-before scenarios. In ... | Traditional MVS methods focus on designing neighbor selection and photometric error measures for efficient and accurate reconstruction @cite_26 @cite_34 @cite_9 . Furukawa al @cite_22 adopted geometric structures to reconstruct textured regions and applied Markov random fields to recover per-view depth maps. Langguth a... | {
"cite_N": [
"@cite_18",
"@cite_26",
"@cite_22",
"@cite_9",
"@cite_29",
"@cite_15",
"@cite_34",
"@cite_11"
],
"mid": [
"2156116778",
"2257063750",
"",
"",
"2098551034",
"2519384515",
"",
"2519683295"
],
"abstract": [
"We present a multi-view... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_18: We present a multi-view stereo algorithm that addresses the extreme changes in lighting, scale, clutter, and other effects in large online community photo collections. Our idea is to intelligently choose images to matc... | The success of existing deep-learning based multi-view stereo (MVS) approaches greatly depends on the availability of large-scale supervision in the form of dense depth maps. Such supervision, while not always possible, tends to hinder the generalization ability of the learned models in never-seen-before scenarios. In ... |
1908.11526 | 2970961333 | The success of existing deep-learning based multi-view stereo (MVS) approaches greatly depends on the availability of large-scale supervision in the form of dense depth maps. Such supervision, while not always possible, tends to hinder the generalization ability of the learned models in never-seen-before scenarios. In ... | Different from the above geometry-based methods, learning-based approaches adopt convolution operation which has powerful feature learning capability for better pair-wise patch matching @cite_32 @cite_7 @cite_10 . Ji al @cite_24 pre-warped the multi-view images to 3D space, then used CNNs to regularize the cost volume.... | {
"cite_N": [
"@cite_35",
"@cite_37",
"@cite_4",
"@cite_7",
"@cite_32",
"@cite_24",
"@cite_31",
"@cite_10",
"@cite_17"
],
"mid": [
"2909918887",
"2964153986",
"2952740189",
"",
"2563100679",
"2964243776",
"2963966978",
"",
"2962793285"
],
... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_35:
@cite_37: We present DeepMVS, a deep convolutional neural network (ConvNet) for multi-view stereo reconstruction. Taking an arbitrary number of posed images as input, we first produce a set of plane-sweep volumes and... | The success of existing deep-learning based multi-view stereo (MVS) approaches greatly depends on the availability of large-scale supervision in the form of dense depth maps. Such supervision, while not always possible, tends to hinder the generalization ability of the learned models in never-seen-before scenarios. In ... |
1908.11526 | 2970961333 | The success of existing deep-learning based multi-view stereo (MVS) approaches greatly depends on the availability of large-scale supervision in the form of dense depth maps. Such supervision, while not always possible, tends to hinder the generalization ability of the learned models in never-seen-before scenarios. In ... | Unsupervised learning has been developed in monocular depth estimation and binocular stereo matching by exploiting the photometric consistency and regularization. Xie al @cite_25 proposed Deep3D to automatically convert 2D videos and images to stereoscopic 3D format. Zhou al @cite_30 proposed an unsupervised monocular ... | {
"cite_N": [
"@cite_30",
"@cite_14",
"@cite_23",
"@cite_13",
"@cite_25"
],
"mid": [
"2609883120",
"2887123368",
"2963906250",
"2751625733",
"2336968928"
],
"abstract": [
"We present an unsupervised learning framework for the task of monocular depth and camera motio... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_30: We present an unsupervised learning framework for the task of monocular depth and camera motion estimation from unstructured video sequences. In common with recent work [10, 14, 16], we use an end-to-end learning appro... | The success of existing deep-learning based multi-view stereo (MVS) approaches greatly depends on the availability of large-scale supervision in the form of dense depth maps. Such supervision, while not always possible, tends to hinder the generalization ability of the learned models in never-seen-before scenarios. In ... |
1908.11399 | 2971293878 | Understanding the morphological changes of primary neuronal cells induced by chemical compounds is essential for drug discovery. Using the data from a single high-throughput imaging assay, a classification model for predicting the biological activity of candidate compounds was introduced. The image recognition model wh... | Recent years have seen an explosion of applications of the deep learning methods to medical imaging, including computer-aided diagnosis (CAD) in radiology and medical image analysis @cite_37 @cite_23 @cite_27 . The efficiency of deep learning models for cytometry @cite_2 has been widely recognised and applied to cell i... | {
"cite_N": [
"@cite_30",
"@cite_37",
"@cite_26",
"@cite_4",
"@cite_22",
"@cite_7",
"@cite_9",
"@cite_42",
"@cite_19",
"@cite_27",
"@cite_23",
"@cite_2"
],
"mid": [
"2751723768",
"2731899572",
"",
"2107554012",
"2794301983",
"",
"29045911... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_30: Abstract Abundant accumulation of digital histopathological images has led to the increased demand for their analysis, such as computer-aided diagnosis using machine learning techniques. However, digital pathological i... | Understanding the morphological changes of primary neuronal cells induced by chemical compounds is essential for drug discovery. Using the data from a single high-throughput imaging assay, a classification model for predicting the biological activity of candidate compounds was introduced. The image recognition model wh... |
1908.11518 | 2971189344 | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... | There has been growing interest in first-order algorithms for non-convex minimization problems with no constraints or simple constraints in both stochastic and deterministic settings. Initially, the research in this direction mainly focuses on problems with smooth objective functions @cite_31 @cite_55 @cite_0 @cite_8 @... | {
"cite_N": [
"@cite_67",
"@cite_26",
"@cite_8",
"@cite_55",
"@cite_9",
"@cite_42",
"@cite_52",
"@cite_102",
"@cite_89",
"@cite_0",
"@cite_57",
"@cite_79",
"@cite_50",
"@cite_88",
"@cite_31",
"@cite_66"
],
"mid": [
"",
"2963625269",
"2570... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_67:
@cite_26:
@cite_8: We analyze a fast incremental aggregated gradient method for optimizing nonconvex problems of the form minΣ i ƒ i (x). Specifically, we analyze the SAGA algorithm within an Incremental First-orde... | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... |
1908.11518 | 2971189344 | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... | When all constraint functions in are affine, a primal-dual Frank-Wolfe method is proposed in @cite_72 , and it finds an @math -stationary point with a complexity of @math in general and @math when there exists a strictly feasible solution. Compared to @cite_72 , this paper uses a different notion of @math -stationary p... | {
"cite_N": [
"@cite_72"
],
"mid": [
"2805494515"
],
"abstract": [
"We study constrained stochastic programs where the decision vector at each time slot cannot be chosen freely but is tied to the realization of an underlying random state vector. The goal is to minimize a general objective function... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_72: We study constrained stochastic programs where the decision vector at each time slot cannot be chosen freely but is tied to the realization of an underlying random state vector. The goal is to minimize a general object... | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... |
1908.11518 | 2971189344 | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... | As a classical approach for solving constrained optimization , a penalty method finds an approximate solution by solving a sequence of unconstrained subproblems, where the violation of constraints is penalized by the positively weighted penalty terms in the objective function of the subproblems. Unconstrained optimizat... | {
"cite_N": [
"@cite_99",
"@cite_69",
"@cite_91",
"@cite_7",
"@cite_33",
"@cite_70",
"@cite_97",
"@cite_53",
"@cite_90",
"@cite_78",
"@cite_60",
"@cite_27",
"@cite_23",
"@cite_100",
"@cite_34",
"@cite_10",
"@cite_17"
],
"mid": [
"1994126718",... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_99: Consider the problem of finding the local constrained minimum @math of the function f on the set [ F = x R^n | _i (x) 0, _ j + k (x) = 0; i = 1,2, ,k; j = 1,2, ,l . ]One method of solution is to minimize the associated... | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... |
1908.11518 | 2971189344 | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... | On solving a problem with a non-convex objective and linear constraint, @cite_25 has developed a quadratic-penalty accelerated inexact proximal point method. That method can generate an @math -stationary point in the sense of with a complexity of @math . Our method is similar to that in @cite_25 by utilizing the techni... | {
"cite_N": [
"@cite_25"
],
"mid": [
"2787445655"
],
"abstract": [
"This paper analyzes the iteration-complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. More specifically, the objective function is of the form ... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_25: This paper analyzes the iteration-complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. More specifically, the objective function is ... | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... |
1908.11518 | 2971189344 | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... | Barrier methods @cite_54 @cite_83 @cite_56 @cite_74 @cite_16 @cite_11 @cite_3 @cite_36 @cite_13 are another traditional class of algorithms for constrained optimization. Similar to the penalty methods, they also solve a sequence of unconstrained subproblems with barrier functions added to objective function. The barrie... | {
"cite_N": [
"@cite_36",
"@cite_54",
"@cite_3",
"@cite_56",
"@cite_83",
"@cite_74",
"@cite_5",
"@cite_16",
"@cite_13",
"@cite_11"
],
"mid": [
"",
"1987953347",
"2011430287",
"2157590940",
"2014746566",
"1964015691",
"2962970587",
"2069671092... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_36:
@cite_54: Interest in linear programming has been intensified recently by Karmarkar's publication in 1984 of an algorithm that is claimed to be much faster than the simplex method for practical problems. We review cl... | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... |
1908.11518 | 2971189344 | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... | The augmented Lagrange method (ALM) @cite_32 @cite_20 @cite_18 @cite_35 is another common choice for constrained problems. Different from the exact or quadratic penalty method, ALM estimates the primal solution together with the dual solution. At each iteration, it updates the primal variable by minimizing the augmente... | {
"cite_N": [
"@cite_30",
"@cite_35",
"@cite_64",
"@cite_41",
"@cite_29",
"@cite_2",
"@cite_20",
"@cite_38",
"@cite_18",
"@cite_4",
"@cite_39",
"@cite_49",
"@cite_17",
"@cite_32",
"@cite_19",
"@cite_12",
"@cite_82",
"@cite_61",
"@cite_53",
... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_30: In this paper, we analyze the convergence of the alternating direction method of multipliers (ADMM) for minimizing a nonconvex and possibly nonsmooth objective function, ( (x_0, ,x_p,y) ), subject to coupled linear equ... | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... |
1908.11518 | 2971189344 | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... | While preparing this paper, we notice two recently posted papers @cite_86 @cite_76 on the problems with non-convex constraints. The algorithms in both works are based on the proximal point method. Different from our approach, they solve subproblems with strongly convex objective and also strongly convex constraints by ... | {
"cite_N": [
"@cite_86",
"@cite_76",
"@cite_48"
],
"mid": [
"2964862314",
"",
"2964772384"
],
"abstract": [
"Nonconvex optimization is becoming more and more important in machine learning and operations research. In spite of recent progresses, the development of provably efficient... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_86: Nonconvex optimization is becoming more and more important in machine learning and operations research. In spite of recent progresses, the development of provably efficient algorithm for optimization with nonconvex fun... | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... |
1908.11518 | 2971189344 | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... | In addition to the methods above, algorithms that utilize Hessian information have been developed to find the second-order @math -stationary point of linearly constrained smooth non-convex optimization @cite_87 @cite_71 @cite_15 . Different from these works, we focus on finding an approximate first-order stationary poi... | {
"cite_N": [
"@cite_15",
"@cite_71",
"@cite_87"
],
"mid": [
"2959708829",
"2895571900",
"2788706426"
],
"abstract": [
"This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and line... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_15: This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints. While finding (approximate) SOSPs is com... | Non-convex optimization problems arise from various areas in science and engineering. Although many numerical methods and theories have been developed for unconstrained non-convex problems, the parallel development for constrained non-convex problems remains limited. That restricts the practices of mathematical modelin... |
1908.11053 | 2970409889 | Formal query generation aims to generate correct executable queries for question answering over knowledge bases (KBs), given entity and relation linking results. Current approaches build universal paraphrasing or ranking models for the whole questions, which are likely to fail in generating queries for complex, long-ta... | Semantic parsing-based approaches translate questions into formal queries using bottom up parsing @cite_5 or staged query graph generation @cite_12 . gAnswer @cite_15 @cite_1 builds up semantic query graph for question analysis and utilize subgraph matching for disambiguation. Recent studies combine parsing based appro... | {
"cite_N": [
"@cite_5",
"@cite_15",
"@cite_1",
"@cite_12"
],
"mid": [
"2252136820",
"2011992920",
"2766317792",
"2251079237"
],
"abstract": [
"In this paper, we train a semantic parser that scales up to Freebase. Instead of relying on annotated logical forms, which is espe... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_5: In this paper, we train a semantic parser that scales up to Freebase. Instead of relying on annotated logical forms, which is especially expensive to obtain at large scale, we learn from question-answer pairs. The main ... | Formal query generation aims to generate correct executable queries for question answering over knowledge bases (KBs), given entity and relation linking results. Current approaches build universal paraphrasing or ranking models for the whole questions, which are likely to fail in generating queries for complex, long-ta... |
1908.11056 | 2971248932 | In the face of growing needs for water and energy, a fundamental understanding of the environmental impacts of human activities becomes critical for managing water and energy resources, remedying water pollution, and making regulatory policy wisely. Among activities that impact the environment, oil and gas production, ... | Dictionary learning has been widely used in computer vision to obtain basic components and sparse representations of images @cite_7 . Recently, in order to optimize the learned dictionary for a specific task, people proposed supervised dictionary learning @cite_1 . Some methods learn discriminative dictionaries for dif... | {
"cite_N": [
"@cite_14",
"@cite_7",
"@cite_8",
"@cite_1",
"@cite_5",
"@cite_11"
],
"mid": [
"",
"2536599074",
"2032768707",
"2128638419",
"2151768982",
""
],
"abstract": [
"",
"We propose in this paper to unify two different approaches to image restorat... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_14:
@cite_7: We propose in this paper to unify two different approaches to image restoration: On the one hand, learning a basis set (dictionary) adapted to sparse signal descriptions has proven to be very effective in im... | In the face of growing needs for water and energy, a fundamental understanding of the environmental impacts of human activities becomes critical for managing water and energy resources, remedying water pollution, and making regulatory policy wisely. Among activities that impact the environment, oil and gas production, ... |
1908.11044 | 2971299764 | We present a general paradigm for dynamic 3D reconstruction from multiple independent and uncontrolled image sources having arbitrary temporal sampling density and distribution. Our graph-theoretic formulation models the Spatio-temporal relationships among our observations in terms of the joint estimation of their 3D g... | Temporal alignment is a necessary pre-processing step for most dynamic 3D reconstruction methods. Current video synchronization or image sequencing @cite_42 @cite_44 @cite_27 @cite_18 @cite_29 @cite_19 rely on the image 2D features, foregoing the recovery of the 3D structure. Feature-based sequencing methods like @cite... | {
"cite_N": [
"@cite_30",
"@cite_18",
"@cite_29",
"@cite_42",
"@cite_44",
"@cite_19",
"@cite_27",
"@cite_16",
"@cite_25",
"@cite_20"
],
"mid": [
"",
"2167747244",
"1886695513",
"",
"2152136819",
"",
"1901796002",
"2126784706",
"2097446893... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_30:
@cite_18: In this paper, we consider the problem of estimating the spatiotemporal alignment between N unsynchronized video sequences of the same dynamic 3D scene, captured from distinct viewpoints. Unlike most existi... | We present a general paradigm for dynamic 3D reconstruction from multiple independent and uncontrolled image sources having arbitrary temporal sampling density and distribution. Our graph-theoretic formulation models the Spatio-temporal relationships among our observations in terms of the joint estimation of their 3D g... |
1908.11315 | 2970031230 | Due to its hereditary nature, genomic data is not only linked to its owner but to that of close relatives as well. As a result, its sensitivity does not really degrade over time; in fact, the relevance of a genomic sequence is likely to be longer than the security provided by encryption. This prompts the need for speci... | Membership inference. @cite_33 present a membership inference attack in which they infer the presence of an individual's genotype within a complex genomic DNA mixture. @cite_2 improve on the attack using correlation statistics of just a few hundreds SNPs, while @cite_16 rely on regression coefficients. Shringarpure and... | {
"cite_N": [
"@cite_30",
"@cite_33",
"@cite_9",
"@cite_2",
"@cite_16",
"@cite_11"
],
"mid": [
"1838635991",
"2040228409",
"2952306472",
"2141481372",
"2134493890",
"1526729971"
],
"abstract": [
"The human genetics community needs robust protocols that enabl... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_30: The human genetics community needs robust protocols that enable secure sharing of genomic data from participants in genetic research. Beacons are web servers that answer allele-presence queries—such as “Do you have a g... | Due to its hereditary nature, genomic data is not only linked to its owner but to that of close relatives as well. As a result, its sensitivity does not really degrade over time; in fact, the relevance of a genomic sequence is likely to be longer than the security provided by encryption. This prompts the need for speci... |
1908.11315 | 2970031230 | Due to its hereditary nature, genomic data is not only linked to its owner but to that of close relatives as well. As a result, its sensitivity does not really degrade over time; in fact, the relevance of a genomic sequence is likely to be longer than the security provided by encryption. This prompts the need for speci... | Data sharing. Progress in genomics research is dependent on collaboration and data sharing among different institutions. Given the sensitive nature of the data, as well as regulatory and ethics constraints, this often proves to be a challenging task. @cite_4 propose the use of secret sharing to distribute data among se... | {
"cite_N": [
"@cite_14",
"@cite_21",
"@cite_4",
"@cite_3"
],
"mid": [
"2951951981",
"2568218703",
"2166106997",
""
],
"abstract": [
"Motivation: Advances in genome sequencing and genomics research are bringing us closer to a new era of personalized medicine, where healthca... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_14: Motivation: Advances in genome sequencing and genomics research are bringing us closer to a new era of personalized medicine, where healthcare can be tailored to the individual’s genetic makeup, and to more effective d... | Due to its hereditary nature, genomic data is not only linked to its owner but to that of close relatives as well. As a result, its sensitivity does not really degrade over time; in fact, the relevance of a genomic sequence is likely to be longer than the security provided by encryption. This prompts the need for speci... |
1908.11315 | 2970031230 | Due to its hereditary nature, genomic data is not only linked to its owner but to that of close relatives as well. As a result, its sensitivity does not really degrade over time; in fact, the relevance of a genomic sequence is likely to be longer than the security provided by encryption. This prompts the need for speci... | Privacy-friendly testing. Another line of work focuses on protecting privacy in the context of personal genomic testing, i.e., computational tests run on sequenced genomes to assess, e.g., genetic susceptibility to diseases, determining the best course of treatment, etc. @cite_31 assume that each individual keeps a cop... | {
"cite_N": [
"@cite_31",
"@cite_34",
"@cite_13",
"@cite_6"
],
"mid": [
"2087135382",
"2133711597",
"2885741165",
"2056556714"
],
"abstract": [
"Recent advances in DNA sequencing technologies have put ubiquitous availability of fully sequenced human genomes within reach. It... | generate_abstract_from_reference | Following are the abstracts of some related work. Can you use it to generate the abstract?
{% for abs in ref_abstract["abstract"] %}
{{ref_abstract["cite_N"][loop.index-1]}}: {{abs}}
{% endfor %} |||
{{abstract}} | Following are the abstracts of some related work. Can you use it to generate the abstract?
@cite_31: Recent advances in DNA sequencing technologies have put ubiquitous availability of fully sequenced human genomes within reach. It is no longer hard to imagine the day when everyone will have the means to obtain and sto... | Due to its hereditary nature, genomic data is not only linked to its owner but to that of close relatives as well. As a result, its sensitivity does not really degrade over time; in fact, the relevance of a genomic sequence is likely to be longer than the security provided by encryption. This prompts the need for speci... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.