aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
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": [
"2080743555",
"1641082372",
"1990891135",
"2023137590"
],
"abstract": [
"The aim of this paper is to construct new topological invariants of compact oriented 3-manifolds and of framed links in such manifolds. Our invariant of (a link... |
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": [
"2949560198",
"2751901133",
"2109910161",
"2130913800"
],
"abstract": [
"We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, ... |
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": [
"1799262171",
"1960457407",
"2795050613",
"2074992286"
],
"abstract": [
"Given two graphs @math and @math , the Subgraph Isomorphism problem asks if @math is isomorphic to a subgraph of @math . While NP-hard in general, algorithms exist for various ... |
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": [
"2198155329",
"2022437913",
"2073656615",
"1009009209"
],
"abstract": [
"Patch-based low-rank models have shown effective in exploiting spatial redundancy of natural images especially for the application of image denoising. However, two-dimensional l... |
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": [
"2165006697",
"2171438172",
"2116210226",
"2093922742"
],
"abstract": [
"Optimizing programs at run-time provides opportunities to apply aggressive optimizations to programs based on information that was not available at compile time. At run time, pr... |
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": [
"2171438172",
"2788459922",
"2165006697",
"2116210226"
],
"abstract": [
"Traditional query optimizers assume accurate knowledge of run-time parameters such as selectivitie... |
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": [
"2165006697",
"2093922742",
"2130570838",
"2115971347"
],
"abstract": [
"Optimizing programs at run-time provides opportun... |
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",
"2118300983",
"2147650421",
"1984632619"
],
"abstract": [
"This paper describes the motivations and strategies behind our group’s efforts to integrate the Tcl and Java programming languages. From the Jav... |
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": [
"1992572456",
"2141847212",
"2152342374",
"2022574854"
],
"abstract": [
"We construct new supersymmetric solutions of D = 11 supergravity describing n orthogonally “overlapping” membranes and fivebranes for n = 2,…,8... |
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": [
"2054280159",
"1992572456",
"2048444779",
"2045285156"
],
"abstract": [
"Abstract We present non-extreme generalisations of intersecting p -brane solutions of eleven-dimensional supergravity which upon toroidal compactification redu... |
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": [
"2086840642",
"1992572456",
"2054280159",
"2152342374"
],
"abstract": [
"Abstract We present a general rule determining how extremal branes can intersect in a configuration with zero binding energy. The rule is deri... |
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": [
"2086840642",
"2152342374",
"2054280159",
"1992572456"
],
"abstract": [
"Abstract We present a general rule determining how extremal branes can intersect in a configuration with zero binding energy. The rule is derive... |
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": [
"1992572456",
"2048444779",
"2054280159",
"2086840642"
],
"abstract": [
"We construct new supersymmetric solutions of D = 11 supergravity describing n orthogonally “overlapping” membranes and fivebranes for n = 2,…,8... |
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": [
"1992572456",
"2048444779",
"2019049541",
"2152342374"
],
"abstract": [
"We construct new supersymmetric solutions of D = 11 supergravity describing n orthogonally “overlapping” membranes and fivebranes for n = 2,…,8. Overlapping bran... |
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": [
"1992572456",
"2086840642",
"2048444779",
"2054280159"
],
"abstract": [
"We construct new supersymmetric solutions of D = 11 supergravity describing n orthogonally “overlapping” membranes and fivebranes for n = 2,…,8... |
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": [
"2556289220",
"1993599520",
"1571751884",
"1994273294"
],
"abstract": [
"In this study, with Singapore as an example, we demonstrate how we can use mobile phone call detail record (CDR) data, which contains millions of anonymous users, to extract ind... |
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": [
"2005411736",
"2076773434",
"1994267277",
"1659111644"
],
"abstract": [
"In heterogeneous cellular networks spatial characteristics of base stations (BSs) influence the system performance intensively. Existing models lik... |
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": [
"2060977605",
"2106353989",
"1938668859",
"2022798939"
],
"abstract": [
"This paper proposes a pose-based algorithm to solve the full Simultaneous Localization And Mapping (SLAM) problem for an Autonom... |
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": [
"1762798876",
"2607603241",
"2606149788",
"2964213755"
],
"abstract": [
"We introduce a novel matching algorithm, called DeepMatching, to compute dense correspondences bet... |
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": [
"2289772031",
"2749407104",
"2258484932",
"2161381512"
],
"abstract": [
"Convolutional neural networks (CNNs) have recently achieved remarkable successes in various image classification and understanding tasks. The deep... |
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": [
"1946093182",
"2479919622",
"2199890863",
"2949514689"
],
"abstract": [
"The recent availability of geo-tagged images and rich geospatial data has inspired a number of algorithms for image based geolocalization. Most a... |
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": [
"1946093182",
"2479919622",
"1984093092",
"2199890863"
],
"abstract": [
"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 o... |
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": [
"2247236687",
"1980652450",
"2206841333",
"2962884567"
],
"abstract": [
"We investigate the (generalized) Walsh decomposition... |
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",
"2315383458",
"2736121037",
"1938602245"
],
"abstract": [
"This ... |
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",
"1938602245",
"2736121037",
"2256710691"
],
"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 alt... |
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": [
"2949964922",
"2118142207",
"2126810476",
"2062244797"
],
"abstract": [
"Building a dialogue agent to fulfill complex tasks, such as travel planning, is challenging because the agent has to learn to collectively complete multiple subtasks. For examp... |
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": [
"2034373223",
"2137628566",
"2168617729",
"2067273780"
],
"abstract": [
"We present a new approach to adding state and state-changing commands to a term language. As a formal semantics it can be seen as a generalization of predicate transformer seman... |
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": [
"2038721957",
"1578881253",
"2144108169",
"2962984063"
],
"abstract": [
"Part 1 The lexical database: nouns in WordNet, George A. Miller modifiers in WordNet, Katherine J. Miller a semantic network of English verbs, Christiane Fellba... |
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": [
"2165897980",
"1561908597",
"128995279",
"2952637164"
],
"abstract": [
"Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers, t... |
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": [
"2097645432",
"1988790447",
"2069317438",
"2003677307"
],
"abstract": [
"In most kernel based online learning algorithms, when an incoming instance is misclassified, it will be added into the pool of support vectors an... |
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",
"1564910013",
"2962845465",
"2122514299"
],
"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 assump... |
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": [
"2101445408",
"1990671169",
"1733954365",
"1541473376"
],
"abstract": [
"We report evaluation results for real users of a learnt dialogue management policy versus a hand-coded policy in the TALK project's \"Townlnfo\" to... |
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",
"2016630033",
"2168966090",
"2079442239"
],
"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 fro... |
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": [
"2168671000",
"2119997945",
"2316213087",
"2128810992"
],
"abstract": [
"This paper reports on an empirically based system that automatically resolves VP ellipsis in the 644 examples identified in the parsed Penn Treebank. The results reported here r... |
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": [
"2168671000",
"2139801570",
"2115755647",
"1999281702"
],
"abstract": [
"This paper reports on an empirically based system that automatically resolves VP ellipsis in the 644 examples identified in the parsed Penn Treebank. The results reported here r... |
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": [
"2168671000",
"1568155371",
"2040110103",
"1564002882"
],
"abstract": [
"This paper reports on an empirically based system that automatically resolves VP ellipsis in the 644 examples identified in the parsed Penn Treebank. The results reported here r... |
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": [
"1975697571",
"2084069552",
"2126349848",
"2104952406"
],
"abstract": [
"There is increased interest in the use of color barcodes to encode more information per area unit than regular, black-and-white barcodes. For example, Microsoft's HCCB technolog... |
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": [
"2141454789",
"2150285483",
"2124007994",
"2168002876"
],
"abstract": [
"We consider the problem of recovering polynomials that are sparse with respect to the basis of Legendre polynomials from a small number of random samples. In pa... |
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",
"2112861996",
"2142523187",
"2046224275"
],
"abstract": [
"Abstract A system for part-of-speech tagging is described. It is based on a hidden Markov model which can be traine... |
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": [
"2142523187",
"2140497009",
"2097227294",
"1574126082"
],
"abstract": [
"We describe a novel approach for inducing unsupervised part-of-speech taggers for languages that have no labeled training data, but have translated text in a resource-rich langu... |
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": [
"2100796029",
"2123489126",
"2949482574",
"2308486447"
],
"abstract": [
"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 int... |
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": [
"2121127625",
"2111305191",
"2141099517",
"910440858"
],
"abstract": [
"This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with as... |
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",
"2155558996",
"1527783480",
"2091232155"
],
"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 ... |
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": [
"2126022166",
"2141253686",
"2019575783",
"2963185791"
],
"abstract": [
"This paper studies two-class (or binary) classification of elements X in R k that allows for a reject option. Based on n independent copies of the pair of random variables (X,Y ... |
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": [
"2547508527",
"2126022166",
"2141789531",
"2598300585"
],
"abstract": [
"We present an algorithm for the statistical learning setting with a bounded exp-concave loss in @math dimensions that obtains excess risk @math with probability at least @math ... |
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": [
"2064493067",
"2963972775",
"1964510837",
"1543491698"
],
"abstract": [
"We present a deterministic near-linear time algorithm that computes the edge-connectivity and finds a minimum cut for a simple undirected unweig... |
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": [
"2963972775",
"2064493067",
"2569104968",
"1564010364"
],
"abstract": [
"We present a deterministic algorithm that computes the edge-connectivity of a graph in near-linear time. This is for a simple undirected unweight... |
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": [
"2587989515",
"2950975557",
"2559597482",
"1923115158"
],
"abstract": [
"In this paper we address the problem of semantic labeling of indoor scenes on RGB-D data. With the... |
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": [
"2962912109",
"2766577666",
"2890441886",
"2946747865"
],
"abstract": [
"We address semantic segmentation of road-objects from 3D LiDAR poin... |
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": [
"1602925513",
"2167352300",
"2140028191",
"1986424898"
],
"abstract": [
"A temporal logic based on actions rather than on states is presented and interpreted over labelled transition syst... |
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": [
"1986424898",
"1577069963",
"2127508398",
"1599831144"
],
"abstract": [
"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 rewritin... |
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": [
"2109187338",
"2151284417",
"2167672803",
"1986424898"
],
"abstract": [
"Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of s... |
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",
"1986424898",
"1583068981",
"2160106331"
],
"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 s... |
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",
"1689232663",
"2956034981",
"2121059325"
],
"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 w... |
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": [
"1497640022",
"1919563168",
"2143082793",
"1887504389"
],
"abstract": [
"One obtains in this paper a process algebra RCCS, in the style of CCS, where processes can backtrack. Backtrack,... |
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": [
"2152988203",
"2091676842",
"2172422010",
"1996109622"
],
"abstract": [
"With their intuitive graphical approach and expressive analysis techniques, Petri nets are suitable for a wide range of applications and teaching scenarios, and they have gaine... |
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": [
"1601458080",
"1599831144",
"1488471656",
"2287769028"
],
"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 ke... |
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",
"1928673936",
"2242425235"
],
"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... |
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",
"1697381716",
"2007329840",
"1488037644"
],
"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 purpo... |
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",
"1561324106",
"1988680012"
],
"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 exogen... |
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": [
"2404118354",
"2133038101",
"1964587130",
"2048903680"
],
"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 transit... |
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": [
"2516141709",
"2623629680",
"2899915146",
"2808523546"
],
"abstract": [
"This work observes that a large fraction of the computations performed by Deep Neural Networks (D... |
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": [
"2508647357",
"2162310490",
"2069906566",
"2754084392"
],
"abstract": [
"Spanners, emulators, and approximate distance oracles can be viewed as lossy compression schemes that represent a... |
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": [
"2788715907",
"2515385951",
"2962965870",
"2964209717"
],
"abstract": [
"In recent years considerable research efforts have been devoted to compression techniques of convolutional neural... |
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": [
"2059343366",
"2787697768",
"1965106955",
"2951675964"
],
"abstract": [
"Hardware implementation of lossless data compression is important for optimizing the capacity cost power of storage devices in data centers, as well as communication channels i... |
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": [
"2884180697",
"1965106955",
"2177847924",
"1955069752"
],
"abstract": [
"Weight pruning methods of deep neural networks have been demonstrated to achieve a good model pruning ratio without loss of accuracy, thereby alleviating the significant comput... |
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": [
"2250225488",
"2444236087",
"2251957808",
"2607617947"
],
"abstract": [
"A c... |
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",
"2802314446",
"2337798556",
"2549514639"
],
"abstract": [
"We initiate the study of incentives in a general machine learning framework. We foc... |
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": [
"2583393691",
"2082729696",
"2097300420",
"2058053171"
],
"abstract": [
"This paper proposes a novel approach for constructing effective personalized policies when the observed data lacks counter-factual information, is... |
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": [
"2794674331",
"2930558539",
"2532967691",
"2949560198"
],
"abstract": [
"The notion of Local Differential Privacy (LDP) enables users to resp... |
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": [
"2799694080",
"2514333820",
"2170255835",
"2145801920"
],
"abstract": [
"Users in various web and mobile applications are vulnerable to attribute inference attacks, in which an attacker leverages a machine learning classifier to infer... |
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": [
"2610910029",
"2365029783",
"1518033500",
"2525846285"
],
"abstract": [
"In this work we provide efficient distributed protocols for generating shares of random noise, se... |
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": [
"2761138375",
"2727025244",
"2607063282",
"2793901360"
],
"abstract": [
"The large-scale monitoring of computer users' software activities has become commonplace, e.g., for application telemetry, error ... |
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": [
"2525846285",
"2154625773",
"1597292924",
"1667014488"
],
"abstract": [
"This paper considers the problem of secure data aggregation (mainly summation) in a distributed setting, while ensuring differential privacy of the result. We s... |
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": [
"2125327503",
"2251818274",
"1989135160",
"1834987204"
],
"abstract": [
"It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provi... |
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": [
"2609701267",
"2963476860",
"189742998",
"2311233238"
],
"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 estimat... |
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": [
"1972775782",
"2081055073",
"2131588774",
"1582826078"
],
"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... |
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",
"2081055073",
"2086702855",
"1526420573"
],
"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... |
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": [
"1498202041",
"25030497",
"2100580556",
"1582826078"
],
"abstract": [
"We study rendezvous of two anonymous agents, where each agent knows its own initial position in the... |
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": [
"2179376195",
"1969099455",
"2086702855",
"1535538796"
],
"abstract": [
"We consider the problem of gathering identical, memoryless, mobile agents in one node of an anonymous graph. Agents start from different nodes of the graph. The... |
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",
"2100580556",
"2068322213",
"2128634904"
],
"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 nod... |
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": [
"2010017329",
"2782960731",
"1995782858",
"1965243636"
],
"abstract": [
"In this paper we study the problem of gathering a collection of identical oblivious mobile robots in the same location of the plane. Previous investigations have focused mostly ... |
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": [
"832925222",
"1539230104",
"2338968644",
"2106505277"
],
"abstract": [
"Accurate recovery of 3D geometrical surfaces from calibrated 2D mu... |
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": [
"2798365843",
"1772650917",
"2963502507",
"2574952845"
],
"abstract": [
"Compared to earlier multistage frameworks using CN... |
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": [
"2785512290",
"2963906250",
"2887848798",
"2892197942"
],
"abstract": [
"We present a novel approach for unsupervised learning of depth and ego-motion from monocular video. Unsupervised... |
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": [
"2794022343",
"2731899572",
"2950489286",
"2253429366"
],
"abstract": [
"Abst... |
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": [
"2962851402",
"2766153148",... |
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": [
"2157959686",
"2460087882",
"905619",
"1877183374"
],
"abstract": [
"In this paper we develop a new affine-invariant primal–dual subgradient method for nonsmooth convex optimization problems. This scheme is based on a self-concordant barrier for the... |
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": [
"2893640118",... |
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",
"2893640118",
"2962721705",
"2070740567"
],
"abstract": [
"This paper analyzes the iteration-complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. Mor... |
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": [
"2962853966",
"2893640118",
"2011430287",
"1986891697"
],
"abstract": [
"In this paper, we analyze the conv... |
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",
... |
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": [
"2964772384",
"2011430287",
"2964271484",
"2962853966"
],
"abstract": [
"Optimization models with non-convex constraints arise in many tasks in machine learning, e.g., learning with fairness constraints or Neyman-Pear... |
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": [
"2895571900",
"2963349772",
"2767752488",
"2769394111"
],
"abstract": [
"We consider the problem of finding an approximate second-order stationary point of a constrained non-convex optimization problem. We first show ... |
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": [
"2251079237",
"2192410469",
"2444318157",
"2251143283"
],
"abstract": [
"We propose a novel semantic parsing framework for question answering using a knowledge base. We define a query graph that resemble... |
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": [
"1982405594",
"2529138057",
"2142940228",
"1784617778"
],
"abstract": [
"The employed dictionary plays an important role in sparse representation or sparse coding based imag... |
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",
"2101092098",
"2468215248",
"2030351687"
],
"abstract": [
"In this paper, we consider the p... |
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": [
"2952306472",
"1838635991",
"2532520288",
"2040228409"
],
"abstract": [
"Genomic datasets are often associated with sensitive phenotypes. Therefore, the leak of membership... |
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",
"2952306472",
"2124398102",
"1990147405"
],
"abstract": [
"Motivation: Advances in genome sequencing and genomics research are bringing us closer to a new era of personalized medicine, wher... |
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": [
"2133711597",
"2952306472",
"2124398102",
"1838635991"
],
"abstract": [
"In this paper, we propose privacy-enhancing technologies for medical tests and personalized medicine methods that use patients' g... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.