Split (3)

train · 28.4k rows

text stringlengths 16 1.64M	label int64 0 10
constrained submodular maximization via technique nov niv moran november abstract the study of combinatorial optimization problems with submodular objective has attracted much attention in recent years such problems are important in both theory and practice because their objective functions are very general obtaining f...	8
self organizing maps whose topologies can be learned with adaptive binary search trees using conditional rotations jun astudillo john abstract numerous variants of maps soms have been proposed in the literature including those which also possess an underlying structure and in some cases this structure itself can be def...	9
robust satisfaction of temporal logic specifications via reinforcement learning oct austin derya zhaodan mac and calin we consider the problem of steering system with unknown stochastic dynamics to satisfy rich temporallylayered task given as signal temporal logic formula we represent the system as markov decision proc...	3
batched qr and svd algorithms on gpus with applications in hierarchical matrix compression jul wajih halim george hatem and david abstract we present high performance implementations of the qr and the singular value decomposition of batch of small matrices hosted on the gpu with applications in the compression of hiera...	8
analytical and simplified models for dynamic analysis of short skew bridges under moving loads feb nguyena goicoleaa group of computational mechanic school of civil engineering upm spain abstract skew bridges are common in highways and railway lines when non perpendicular crossings are encountered the structural effect...	5
efficient pac learning from the crowd apr pranjal avrim nika yishay abstract in recent years crowdsourcing has become the method of choice for gathering labeled training data for learning algorithms standard approaches to crowdsourcing view the process of acquiring labeled data separately from the process of learning c...	8
automated identification of trampoline skills using computer vision extracted pose estimation paul connolly guenole silvestre and chris bleakley sep school of computer science university college dublin belfield dublin ireland abstract novel method to identify trampoline skills using single video camera is proposed here...	1
parsing methods streamlined sep luca breveglieri stefano crespi reghizzi angelo morzenti dipartimento di elettronica informazione bioingegneria deib politecnico di milano piazza leonardo da vinci milano italy email this paper has the goals of unifying parsing with parsing to yield single simple and consistent framework...	6
similarity rasmus pagh ninh pham francesco and morten mar it university of copenhagen denmark abstract we present an algorithm for computing similarity joins based on hashing lsh in contrast to the filtering methods commonly suggested our method has provable subquadratic dependency on the data size further in contrast ...	8
jan completion by derived double centralizer marco porta liran shaul and amnon yekutieli abstract let be commutative ring and let be weakly proregular ideal in if is noetherian then any ideal in it is weakly proregular suppose is compact generator of the category of cohomologically complexes we prove that the derived d...	0
ndt neual decision tree towards fully functioned neural graph han xiao dec abstract though traditional algorithms could be embedded into neural architectures with the proposed principle of xiao the variables that only occur in the condition of branch could not be updated as special case to tackle this issue we multiply...	9
alignment elimination from adams grammars institute of computer science university of tartu liivi tartu estonia jun abstract adams extension of parsing expression grammars enables specifying indentation sensitivity using two grammar constructs indentation by binary relation and alignment this paper proposes transformat...	6
bridging static and dynamic program analysis using fuzzy logic jacob lidman josef svenningsson chalmers university of technology lidman josefs static program analysis is used to summarize properties over all dynamic executions in unifying approach based on logic properties are either assigned definite value or unknown ...	6
complexity of manipulation with partial information in voting jul palash dey tata institute of fundamental research mumbai neeldhara misra indian institute of technology gandhinagar mail narahari indian institute of science bangalore hari january abstract the coalitional manipulation problem has been studied extensivel...	8
achieving the time of but the accuracy of dec lirong xue princeton university abstract we propose simple approach which given distributed computing resources can nearly achieve the accuracy of prediction while matching or improving the faster prediction time of the approach consists of aggregating denoised predictors o...	10
complete intersections of quadrics and the weak lefschetz property feb alzati and re abstract we consider graded artinian complete intersection algebras xm with generated by homogeneous forms of degree we show that the general multiplication by linear form ad is injective we prove that the weak lefschetz property for h...	0
recurrent neural network training with dark knowledge transfer may zhiyuan dong zhiyong center for speech and language technologies cslt riit tsinghua university tsinghua national laboratory for information science and technology chengdu institute of computer applications chinese academy of sciences tangzy zhangzy corr...	9
implementation of distributed coherent quantum observer feb ian petersen and elanor huntington this paper considers the problem of implementing previously proposed distributed direct coupling quantum observer for closed linear quantum system by modifying the form of the previously proposed observer the paper proposes p...	3
valuation theory generalized ifs attractors and fractals mar jan dobrowolski and kuhlmann abstract using valuation rings and valued fields as examples we discuss in which ways the notions of topological ifs attractor and fractal space can be generalized to cover more general settings given functions fn on set we will a...	0
optimal weighted methods aug albert and giovanni august abstract we consider the problem of reconstructing an unknown bounded function defined on domain rd from noiseless or noisy samples of at points xi we measure the reconstruction error in norm for some given probability measure given linear space vm with dim vm we ...	10
how to construct deep recurrent neural networks razvan caglar kyunghyun and yoshua apr informatique et de recherche de pascanur gulcehrc department of information and computer science aalto university school of science abstract in this paper we explore different ways to extend recurrent neural network rnn to deep rnn w...	9
significantly improving lossy compression for scientific data sets based on multidimensional prediction and quantization jun dingwen tao sheng di zizhong chen and franck university of california riverside ca usa chen argonne national laboratory il usa cappello university of illinois at il usa hpc applications are produ...	7
dec change point detection in autoregressive models with no moment assumptions fumiya akashi holger dette waseda university bochum department of applied mathematics mathematik tokyo japan bochum germany yan liu waseda university department of applied mathematics tokyo japan abstract in this paper we consider the proble...	10
feedback generation for performance problems in introductory programming assignments sumit gulwani ivan microsoft research usa tu wien austria sep sumitg radicek florian zuleger tu wien austria zuleger abstract general terms providing feedback on programming assignments manually is tedious error prone and task in this ...	6
nov bayesian identification for selecting influenza mitigation strategies pieter timothy diederik jelena kristof philippe and ann artificial intelligence lab department of computer science vrije universiteit brussel brussels belgium ku leuven university of leuven department of microbiology and immunology rega institute...	2
convex and regularization methods for spatial point processes intensity estimation achmad and mar laboratory jean kuntzmann department of probability and statistics grenoble alpes france department of mathematics du uqam canada march abstract this paper deals with feature selection procedures for spatial point processe...	10
wireless network design for control systems survey aug pangun park sinem coleri ergen carlo fischione chenyang lu and karl henrik johansson networked control systems wncs are composed of spatially distributed sensors actuators and controllers communicating through wireless networks instead of conventional wired connect...	3
mar notes on finitely generated flat modules abolfazl tarizadeh abstract in this article the projectivity of finitely generated flat module of commutative ring is studied through its exterior powers and invariant factors consequently the related results of endo vasconcelos wiegand and on the projectivity of flat module...	0
intphys framework and benchmark for visual intuitive physics reasoning ronan riochet ecole normale superieure inria mario ynocente castro ycmario mar mathieu bernard ecole normale superieure inria adam lerer facebook ai research rob fergus facebook ai research alerer robfergus izard paris descartes cnrs emmanuel dupoux...	2
published as conference paper at iclr hen is earn onvolutional ilter asy simon du carnegie mellon university ssdu jason lee university of southern california jasonlee to yuandong tian facebook ai research yuandong feb bstract we analyze the convergence of stochastic gradient descent algorithm for learning convolutional...	2
ieee transactions on circuits and regular papers optimal tracking performance limitation of networked control systems with limited bandwidth and additive colored white gaussian noise feb guan chen gang feng and tao li paper studies optimal tracking performance issues for linear systems under networked control with limi...	3
comparing powers of edge ideals sep mike janssen thomas kamp and jason vander woude bstract given nontrivial homogeneous ideal problem of great recent interest has been the comparison of the rth ordinary power of and the mth symbolic power this comparison has been undertaken directly via an exploration of which exponen...	0
mar on the noether number of cziszter institute of mathematics hungarian academy of sciences budapest hungary abstract group of order pn prime has an indecomposable polynomial invariant of degree at least if and only if the group has cyclic subgroup of index at most or it is isomorphic to the elementary abelian group o...	4
secret sharing and shared information nov johannes rauh abstract secret sharing is cryptographic discipline in which the goal is to distribute information about secret over set of participants in such way that only specific authorized combinations of participants together can reconstruct the secret thus secret sharing ...	7
new class of permutation trinomials constructed from niho exponents oct tao bai and yongbo abstract permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering in this paper we investigate the trinomial xpq over the finite field w...	7
dynamic ntegration of background nowledge in eural nlu ystems dirk weissenborn german research center for ai chris dyer deepmind tkocisky cdyer oct bstract or background knowledge is required to understand natural language but in most neural natural language understanding nlu systems the requisite background knowledge ...	2
polychronous interpretation of synoptic domain specific modeling language for embedded besnard gautier ouy talpin bodeveix cortier pantel strecker garcia rugina buisson dagnat besnard gautier ouy talpin inria rennes bretagne atlantique irisa campus de beaulieu rennes cedex france bodeveix cortier pantel strecker paul s...	6
distortion for abelian subgroups of out fn jan derrick wigglesworth abstract we prove that abelian subgroups of the outer automorphism group of free group are quasiisometrically embedded our proof uses recent developments in the theory of train track maps by feighnhandel as an application we prove the rank conjecture f...	4
catroid mobile visual programming system for children wolfgang slany institute for software technology graz university of technology inffeldgasse graz austria abstract catroid is free and open source visual programming language programming environment image manipulation program and website catroid allows casual and use...	6
scheduling distributed clusters of parallel machines and approximation algorithms full version riley samir and megan oct department of industrial engineering operations research university of california berkeley berkeley ca usa rjmurray department of computer science university of maryland college park college park md ...	8
oct sound source localization in multipath environment using convolutional neural networks eric stefan williams craig jin australian centre for field robotics the university of sydney australia computing and audio research laboratory the university of sydney australia abstract the propagation of sound in shallow water ...	7
ransac algorithms for subspace recovery and subspace clustering nov ery jue wang university of california san diego abstract we consider the ransac algorithm in the context of subspace recovery and subspace clustering we derive some theory and perform some numerical experiments we also draw some correspondences with th...	10
idle programs idle sensors parallel composition sequential composition termination composition install method invocation module update sensor broadcast sensor sense in if then else field sensing conditional execution arxiv dec network sensors and field off li pi net this modules method collection values variable target...	2
filter and smoother with improved covariance matrix approximation aug henri nurminen tohid ardeshiri robert and fredrik gustafsson count and smoothing algorithms for linear models with measurement noise are presented the presented algorithms use variational bayes based posterior approximation with coupled location and ...	3
based consensus analysis of networks with link failures may xue lin yuanshi zheng and long wang abstract in this paper system is presented which is formulated in terms of the delta operator the proposed system can unify and systems in network in practice the communication among agents is acted upon by various factors t...	3
identifiability of skew normal mixtures with one known component shantanu jaina michael levineb predrag radivojaca michael trossetc dec department of computer science indiana university bloomington indiana department of statistics purdue university west lafayette indiana department of statistics indiana university bloo...	10
complexity of frictional interfaces complex network perspective department of civil engineering and lassonde institute university of toronto canada sharifzadeh faculty of engineering kyushu university hakozaki japan evgin department of civil engineering university of ottawa ontario canada abstract the shear strength an...	5
oct mapping class groups are not linear in positive characteristic button abstract for an orientable surface of finite topological type having genus at least possibly closed or possibly with any number of punctures or boundary components we show that the mapping class group od has no faithful linear representation in a...	4
packing circles within circular containers new heuristic algorithm for the balance constraints case washington alves de luiz leduino de salles antonio carlos and ednei felix corresponding author de aplicadas universidade estadual de campinas limeira sp brazil instituto de tecnologia universidade federal de paulo dos ca...	5
counting racks of order may matthew ashford and oliver may abstract rack on can be thought of as set of maps where each is permutation of such that for all and in blackburn showed that the number of isomorphism classes of racks on is at least and at most where in this paper we improve the upper bound to matching the lo...	4
generalized minimum distance estimators in linear regression with dependent errors jan jiwoong kim university of notre dame abstract this paper discusses minimum distance estimation method in the linear regression model with dependent errors which are strongly mixing the regression parameters are estimated through the ...	10
static analysis of programs using file format specifications raveendra raghavan and apr indian institute of science bangalore and tata consultancy services indian institute of science bangalore raghavan narendran abstract programs that process data that reside in files are widely used in varied domains such as banking ...	6
achievability performance bounds for source coding elad domanovitz and uri erez dec abstract source coding has been proposed as method for compression of distributed correlated gaussian sources in this scheme each encoder quantizes its observation using the same fine lattice and reduces the result modulo coarse lattice...	7
coding and convex splitting for private communication over quantum channels aug mark march abstract the cq wiretap channel is communication model involving classical sender legitimate quantum receiver and quantum eavesdropper the goal of private communication protocol that uses such channel is for the sender to transmi...	7
implementation of travelling salesperson problem using genetic algorithm comparative study of python php and ruby aryo novanto fajar program teknologi informasi dan ilmu universitas brawijaya malang indonesia aryo yudistira world is connected through the internet as the abundance of internet users connected into the we...	6
qualitative assessment of recurrent human motion andre ebert michael till beck andy mattausch lenz belzner and claudia nov mobile and distributed systems group institute for computer science munich germany email belzner linnhoff applications designed to track human motion in combination with wearable sensors during phy...	1
the earth system grid supporting the next generation of climate modeling research david bernholdt shishir bharathi david brown kasidit chanchio meili chen ann chervenak luca cinquini bob drach ian foster peter fox jose garcia carl kesselman rob markel don middleton veronika nefedova line pouchard arie shoshani alex sim...	5
high performance codes for flash memories ahmed hareedy homa esfahanizadeh and lara dolecek mar electrical eng department university of california los angeles los angeles ca usa ahareedy hesfahanizadeh and dolecek dense flash memory devices operate at very low error rates which require powerful error correcting coding ...	7
jan characters for finite simple groups gunter malle and alexandre zalesski abstract let be finite group and for prime let be sylow of character of is called sylp if the restriction of to is the character of the regular representation of if in addition vanishes at all elements of order divisible by is said to be for ev...	4
stability of integral delay equations and stabilization of models iasson karafyllis and miroslav krstic dept of mathematics national technical university of athens zografou campus athens greece email iasonkar dept of mechanical and aerospace university of california san diego la jolla ca email krstic abstract we presen...	3
pursuit of single evader with uncertain information saad aleem jan cameron nowzari george pappas department of electrical systems engineering university of pennsylvania philadelphia pa usa abstract this paper studies problem involving single pursuer and single evader where we are interested in developing pursuit strate...	3
diffeomorphic random sampling using optimal information transport apr martin sarang and klas department of mathematics florida state university bauer department of bioengineering scientific computing and imaging institute university of utah sjoshi department of mathematical sciences chalmers university of technology an...	10
may adaptive algebraic multiscale solver for compressible flow in heterogeneous porous media matei yixuan wang hadi hajibeygi department of geoscience and engineering faculty of civil engineering and geosciences delft university of technology box ga delft the netherlands department of energy resources engineering stanf...	5
decoupling schemes for predicting compressible fluid flows petr vabishchevicha nuclear safety institute russian academy of sciences tulskaya moscow russia friendship university of russia rudn university moscow russia jan peoples abstract numerical simulation of compressible fluid flows is performed using the euler equa...	5
relational concept analysis alexandre jessie marianne and giacomo bourgogne dijon france lirmm cnrs and de montpellier montpellier france limos clermont auvergne france contact jcarbonnel huchard mar abstract formal concept analysis and its associated conceptual structures have been used to support exploratory search t...	2
probabilistic integration role in statistical computation chris mark michael and dino department of statistics university of warwick of mathematics imperial college london school of mathematics statistics and physics newcastle university the alan turing institute for data science department of engineering science unive...	10
cointegration of the daily electric power system load and the weather stefanov eso ead veslets sofia bulgaria szstefanov this paper makes thermal predictive analysis of the electric power system security for day ahead this predictive analysis is set as thermal computation of the expected computation is obtained by coin...	5
published as conference paper at iclr raining wide residual networks for deployment using single bit for each weight feb mark mcdonnell computational learning systems laboratory school of information technology and mathematical sciences university of south australia mawson lakes sa australia bstract for fast and deploy...	9
sandboxing for javascript technical report matthias keil and peter thiemann university of freiburg freiburg germany keilr thiemann jan abstract today javascript applications are composed of scripts from different origins that are loaded at run time as not all of these origins are equally trusted the execution of these ...	6
enumeration of groups whose order factorises in at most primes feb bettina eick february abstract let denote the number of isomorphism types of groups of order we consider the integers that are products of at most not necessarily distinct primes and exhibit formulas for for such introduction the construction up to isom...	4
asymmetric dynamics of outer automorphisms aug mark bell university of illinois mcbell march abstract we consider the action of an irreducible outer automorphism on the closure of outer space this action has dynamics and so under iteration points converge exponentially to for each we give family of outer automorphisms ...	4
topology estimation using graphical models in power distribution grids mar deepjyoti deka michael chertkov and scott backhaus los alamos national laboratory new mexico usa institute of science and technology moscow russia grid is the medium and low voltage part of large power system structurally the majority of distrib...	3
jul groups that are over extension philippe gille abstract let be discretly henselian field whose residue field is separably closed answering question raised by prasad we show that semisimple group is if and only if it after finite tamely ramified extension of keywords linear algebraic groups galois cohomology theory m...	4
submitted to artificial life march simple model of unbounded evolutionary versatility as trend in organismal evolution peter turney institute for information technology national research council of canada ottawa ontario canada phone fax abstract the idea that there are any trends in the evolution of biological organism...	5
apr crafting adversarial input sequences for recurrent neural networks nicolas papernot and patrick mcdaniel ananthram swami and richard harang the pennsylvania state university university park pa mcdaniel united states army research laboratory adelphi md learning models are frequently used to solve complex security pr...	9
characterization for asymptotic dimension growth jan goulnara arzhantseva graham niblo nick wright and jiawen zhang abstract we give characterization for asymptotic dimension growth we apply it to cat cube complexes of finite dimension giving an alternative proof of wright result on their finite asymptotic dimension we...	4
normalizing flows on riemannian manifolds nov mevlana gemici google deepmind mevlana danilo rezende google deepmind danilor shakir mohamed google deepmind shakir abstract we consider the problem of density estimation on riemannian manifolds density estimation on manifolds has many applications in optics and plasma phys...	10
sep the annals of statistics vol no doi institute of mathematical statistics estimation in nonlinear regression with harris recurrent markov by degui dag and jiti university of york university of bergen and monash university in this paper we study parametric nonlinear regression under the harris recurrent markov chain ...	10
memcapacitive neural networks yuriy pershin and massimiliano di ventra jul abstract we show that memcapacitive memory capacitive systems can be used as synapses in artificial neural networks as an example of our approach we discuss the architecture of an neural network based on memcapacitive synapses moreover we demons...	9
minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest mar march abstract let be an simple directed planar graph with nonnegative edge weights we study the fundamental problems of computing global cut of with minimum weight and cycle of with minimum weight the best previously known algorith...	8
survey of algorithms amgad walid faizan ur mohamed abdur saleh purdue university west lafayette usa umm university makkah ksa may may abstract algorithm finds path containing the minimal cost between two vertices in graph plethora of algorithms is studied in the literature that span across multiple disciplines this pap...	8
stabilization of disturbed linear systems over digital channels jan mohammad javad khojasteh mojtaba hedayatpour jorge massimo franceschetti we present an control strategy for stabilizing scalar linear system over digital communication channel having bounded delay and in the presence of bounded system disturbance we pr...	3
mar and numbers enochs and estrada and iacob abstract we define and invariants for modules over commutative noetherian local ring then we show the periodicity of these invariants provided that is hypersurface in case is also gorenstein we see that finitely generated and its matlis dual have the same and numbers introdu...	0
the function and exponent of sparse regression codes with optimal encoding paper studies the performance of sparse regression codes for lossy compression with the distortion criterion in sparse regression code codewords are linear combinations of subsets of columns of design matrix it is shown that with encoding sparse...	7
the conference paper assignment problem using order weighted averages to assign indivisible goods may jing wu nicholas renee and toby csiro and unsw sydney australia lianjingwu ibm watson research center new york usa csiro unsw and tu berlin berlin germany abstract motivated by the common academic problem of allocating...	2
dec estimating monotone probability mass function with known flat regions dragi anevski and vladimir pastukhov centre for mathematical sciences lund university lund sweden abstract we propose new estimator of discrete monotone probability mass function with known flat regions we analyse its asymptotic properties and co...	10
depth prediction from sparse depth samples and single image feb fangchang and sertac we consider the problem of dense depth prediction from sparse set of depth measurements and single rgb image since depth estimation from monocular images alone is inherently ambiguous and unreliable to attain higher level of robustness...	2
entropy rate estimation for markov chains with large state space feb yanjun jiantao tsachy yihong tiancheng february abstract estimating the entropy based on data is one of the prototypical problems in distribution property testing and estimation for estimating the shannon entropy of distribution on elements with indep...	10
arxiv nov predicting rna secondary structures with arbitrary pseudoknots by maximizing the number of stacking pairs samuel abstract the paper investigates the computational problem of predicting rna secondary structures the general belief is that allowing pseudoknots makes the problem hard existing algorithms are heuri...	5
estimating linear and quadratic forms via indirect observations apr anatoli juditsky arkadi nemirovski abstract in this paper we further develop the approach originating in to statistical estimation via convex focus is on estimating linear or quadratic form of an unknown signal known to belong to given convex compact s...	10
apr stochastic variance reduction for nonconvex optimization sashank reddi sjakkamr carnegie mellon university ahmed hefny ahefny carnegie mellon university suvrit sra suvrit massachusetts institute of technology bapoczos carnegie mellon university alex smola alex carnegie mellon university original circulated date feb...	9
may automating embedded analysis capabilities and managing software complexity in multiphysics simulation part ii application to partial differential equations roger pawlowski eric phipps andrew steven owen christopher siefert and matthew staten sandia national april keywords generic programming templating operator ove...	5
faster algorithms for svp and cvp in the norm divesh aggarwal priyanka mukhopadhyay jan january abstract blomer and naewe modified the randomized sieving algorithm of ajtai kumar and sivakumar to solve the shortest vector problem svp the algorithm starts with randomly chosen vectors in the lattice and employs sieving p...	8
on the table of marks of direct product of finite groups feb brendan masterson and pfeiffer abstract we present method for computing the table of marks of direct product of finite groups in contrast to the character table of direct product of two finite groups its table of marks is not simply the kronecker product of t...	4
apr merging joint distributions via causal model classes with low vc dimension dominik janzing planck institute for intelligent systems germany april abstract if denote sets of random variables two different data sources may contain samples from px and py respectively we argue that causal inference can help inferring p...	10
faster computation via rle keita kuboi yuta fujishige shunsuke inenaga hideo bannai masayuki takeda department of informatics kyushu university japan inenaga bannai takeda mar abstract the constrained lcs problem asks one to find longest common subsequence of two input strings and with some constraints the problem is v...	8
jun eine charakterisierung der moduln helmut mathematisches institut der theresienstr germany zoeschinger abstract let be noetherian local ring the injective hull of and homr the matlis dual of the if the canonical monomorphism is surjective is known to be called reflexive with the help of the bass numbers homr of with...	0
flying insect classification with inexpensive sensors yanping chen department of computer science engineering university of california riverside adena why department of entomology university of california riverside gustavo batista university of paulo usp gbatista agenor isca technologies president eamonn keogh departme...	5
polylogarithmic approximation algorithms for akanksha daniel pranabendu saket meirav zehavik abstract jul let be family of graphs canonical vertex deletion problem corresponding to is defined as follows given an undirected graph and weight function find minimum weight subset such that belongs to this is known as weight...	8
streaming data from hdd to gpus for sustained peak performance lucas beyer paolo bientinesi aachen institute for advanced study in computational engineering science financial support from the deutsche forschungsgemeinschaft german research foundation through grant gsc is gratefully acknowledged streaming data from hdd ...	5

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.