text
stringlengths
106
1.79M
label
int64
0
10
constrained submodular maximization via non-symmetric technique cs.ds nov niv moran november abstract the study of combinatorial optimization problems with submodular objective has attracted much attention in recent year. such problems are important in both theory and practice because their objective functions are very...
8
self organizing maps whose topologies can be learned with adaptive binary search trees using conditional rotations cs.ne jun a. astudillo b. john abstract numerous variants of self-organizing maps soms have been proposed in the literature , including those which also possess an underlying structure , and in some cases ...
9
robust satisfaction of temporal logic specifications via reinforcement learning cs.sy 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 formul. we represent the system as ma...
3
batched qr and svd algorithms on gpus with applications in hierarchical matrix compression cs.ms jul wajih halim , george , hatem , and david e. abstrac. 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 compr...
8
analytical and simplified models for dynamic analysis of short skew bridges under moving loads cs.ce feb k. nguyena , j.. 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 encountere. ...
5
efficient pac learning from the crowd cs.lg apr pranjal avrim nika yishay abstract in recent years crowdsourcing has become the method of choice for gathering labeled training data for learning algorithm. standard approaches to crowdsourcing view the process of acquiring labeled data separately from the process of lear...
8
automated identification of trampoline skills using computer vision extracted pose estimation paul w. connolly , guenole c. silvestre and chris j. bleakley cs.cv sep school of computer science , university college dublin , belfield , dublin irelan. abstract novel method to identify trampoline skills using single video ...
1
parsing methods streamlined cs.fl sep luca breveglieri stefano crespi reghizzi angelo morzenti dipartimento di elettronica , informazione bioingegneria deib politecnico di milano piazza leonardo da vinci milano , italy email luca.breveglieri , stefano.crespireghizzi , angelo.morzenti polimi.it this paper has the goals ...
6
similarity rasmus pagh , ninh pham , francesco , and morten cs.ds mar it university of copenhagen , denmark abstrac. we present an algorithm for computing similarity joins based on locality-sensitive hashing ls. in contrast to the filtering methods commonly suggested our method has provable subquadratic dependency on t...
8
math.ac jan completion by derived double centralizer marco porta , liran shaul and amnon yekutieli abstrac. let be commutative ring , and let be weakly proregular ideal i. if is noetherian then any ideal in it is weakly proregula. suppose is compact generator of the category of cohomologically a-torsion complexe. we pr...
0
ndt neual decision tree towards fully functioned neural graph han xiao cs.ne 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 cas. to tackle this issue , w...
9
alignment elimination from adams grammars institute of computer science , university of tartu , j. liivi tartu , estonia harmel.nestra ut.ee cs.pl jun abstract adams extension of parsing expression grammars enables specifying indentation sensitivity using two non-standard grammar constructs indentation by binary relati...
6
bridging static and dynamic program analysis using fuzzy logic jacob lidman josef svenningsson chalmers university of technology lidman , josefs chalmers.se static program analysis is used to summarize properties over all dynamic execution. in unifying approach based on logic properties are either assigned definite val...
6
complexity of manipulation with partial information in voting cs.ma jul palash dey tata institute of fundamental research , mumbai palash.dey tifr.res.in neeldhara misra indian institute of technology , gandhinagar mail neeldhara.com y. narahari indian institute of science , bangalore hari csa.iisc.ernet.in january abs...
8
achieving the time of , but the accuracy of k-nn math.st dec lirong xue princeton university abstract we propose simple approach which , given distributed computing resources , can nearly achieve the accuracy of k-nn prediction , while matching or improving the faster prediction time o. the approach consists of aggrega...
10
complete intersections of quadrics and the weak lefschetz property math.ac feb a. alzati and r. re abstrac. we consider graded artinian complete intersection algebras . . , xm with generated by homogeneous forms of degre. we show that the general multiplication by linear form ad is injectiv. we prove that the weak lefs...
0
recurrent neural network training with dark knowledge transfer stat.ml may zhiyuan , dong , zhiyon. center for speech and language technologies cslt , riit , tsinghua universit. tsinghua national laboratory for information science and technolog. chengdu institute of computer applications , chinese academy of sciences t...
9
implementation of distributed coherent quantum observer quant-ph feb ian r. petersen and elanor h. huntington this paper considers the problem of implementing previously proposed distributed direct coupling quantum observer for closed linear quantum syste. by modifying the form of the previously proposed observer , the...
3
valuation theory , generalized ifs attractors and fractals math.ac mar jan dobrowolski and franz-viktor kuhlmann abstrac. 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 setting. given func...
0
optimal weighted least-squares methods math.na 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 x... . we measure the reconstruction error in norm , for some given probability measur. given lin...
10
how to construct deep recurrent neural networks razvan , caglar , kyunghyun , and yoshua cs.ne apr informatique et de recherche , de , pascanur , gulcehrc iro.umontreal.ca , yoshua.bengio umontreal.ca department of information and computer science , aalto university school of science , kyunghyun.cho aalto.fi abstract i...
9
significantly improving lossy compression for scientific data sets based on multidimensional prediction and error-controlled quantization cs.it jun dingwen tao , sheng di , zizhong chen , and franck university of california , riverside , ca , usa chen cs.ucr.edu argonne national laboratory , il , usa cappello anl.gov u...
7
math.st 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 consi...
10
feedback generation for performance problems in introductory programming assignments sumit gulwani ivan microsoft research , usa tu wien , austria cs.pl sep sumitg microsoft.com radicek forsyte.at florian zuleger tu wien , austria zuleger forsyte.at abstract general terms providing feedback on programming assignments m...
6
cs.lg nov bayesian best-arm identification for selecting influenza mitigation strategies pieter , timothy , diederik m. , jelena , kristof , philippe , and ann artificial intelligence lab , department of computer science , vrije universiteit brussel , brussels , belgium ku leuven university of leuven , department of mi...
2
convex and non-convex regularization methods for spatial point processes intensity estimation achmad , and stat.me 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 proced...
10
wireless network design for control systems survey cs.sy 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 conventi...
3
math.ac mar notes on finitely generated flat modules abolfazl tarizadeh abstrac. in this article , the projectivity of finitely generated flat module of commutative ring is studied through its exterior powers and invariant factor. consequently , the related results of endo , vasconcelos , wiegand , cox-rush and puninsk...
0
intphys framework and benchmark for visual intuitive physics reasoning ronan riochet ecole normale superieure inria mario ynocente castro ycmario gmail.com cs.ai mar ronan.riochet inria.fr mathieu bernard ecole normale superieure inria mathieu.a.bernard inria.fr adam lerer facebook ai research rob fergus facebook ai re...
2
published as conference paper at iclr hen is earn onvolutional ilter asy simon s. du carnegie mellon university ssdu cs.cmu.edu jason d. lee university of southern california jasonlee marshall.usc.edu to yuandong tian facebook ai research yuandong fb.com cs.lg feb bstract we analyze the convergence of stochastic gradie...
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 cs.sy feb zhi-hong guan , chao-yang chen , gang feng , and tao li paper studies optimal tracking performance issues for multi-input-multi...
3
comparing powers of edge ideals math.ac sep mike janssen , thomas kamp , and jason vander woude bstrac. given nontrivial homogeneous ideal . . , problem of great recent interest has been the comparison of the rth ordinary power of and the mth symbolic powe. this comparison has been undertaken directly via an exploratio...
0
math.gr mar on the noether number of p-groups cziszter institute of mathematics , hungarian academy of science. 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 eleme...
4
secret sharing and shared information cs.it nov johannes rauh abstrac. 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 secre. thus , secret ...
7
new class of permutation trinomials constructed from niho exponents cs.it 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 engineerin. in this paper we investigate the trinomial xpq over the finite f...
7
dynamic ntegration of background nowledge in eural nlu ystems dirk weissenborn german research center for ai dirk.weissenborn dfki.de chris dyer deepmind tkocisky , cdyer google.com cs.cl oct bstract common-sense or background knowledge is required to understand natural language , but in most neural natural language un...
2
polychronous interpretation of synoptic , domain specific modeling language for embedded flight-software l. besnard , t. gautier , j. ouy , j.-p. talpin , j.-p. bodeveix , a. cortier , m. pantel , m. strecker , g. garcia , a. rugina , j. buisson , f. dagnat l. besnard , t. gautier , j. ouy , j.-p. talpin inria rennes b...
6
distortion for abelian subgroups of out fn math.gr jan derrick wigglesworth abstrac. we prove that abelian subgroups of the outer automorphism group of free group are quasiisometrically embedde. our proof uses recent developments in the theory of train track maps by feighnhande. as an application , we prove the rank co...
4
catroid mobile visual programming system for children wolfgang slany institute for software technology graz university of technology inffeldgasse , graz , austria wolfgang.slany tugraz.at abstract catroid is free and open source visual programming language , programming environment , image manipulation program , and we...
6
scheduling distributed clusters of parallel machines primal-dual and lp-based approximation algorithms full version riley , samir , and megan cs.ds oct department of industrial engineering operations research , university of california , berkeley berkeley , ca usa rjmurray berkeley.edu department of computer science , ...
8
cs.sd oct sound source localization in multipath environment using convolutional neural networks eric l. , stefan b. williams craig t. 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 so...
7
ransac algorithms for subspace recovery and subspace clustering math.st nov ery arias-castro jue wang university of california , san diego abstract we consider the ransac algorithm in the context of subspace recovery and subspace clusterin. we derive some theory and perform some numerical experiment. we also draw some ...
10
, idle programs idle sensors parallel composition sequential composition termination composition t.v install method invocation module update , , sensor broadcast sensor sense in if then else field sensing conditional execution arxiv cs.dc dec network sensors and field off li pi net this modules method collection values...
2
skew-t filter and smoother with improved covariance matrix approximation cs.sy aug henri nurminen , tohid ardeshiri , robert , and fredrik gustafsson count and smoothing algorithms for linear discrete-time state-space models with skew-t-distributed measurement noise are presente. the presented algorithms use variationa...
3
delta-operator based consensus analysis of multi-agent networks with link failures cs.sy may xue lin , yuanshi zheng , and long wang abstract in this paper , discrete-time multi-agent system is presented which is formulated in terms of the delta operato. the proposed multi-agent system can unify discrete-time and conti...
3
identifiability of two-component skew normal mixtures with one known component shantanu jaina , michael levineb , predrag radivojaca , michael w. trossetc math.st dec department of computer science indiana university , bloomington , indiana , u.s.a. department of statistics purdue university , west lafayette , indiana ...
10
complexity of frictional interfaces complex network perspective h. o. department of civil engineering and lassonde institute , university of toronto , canada m. sharifzadeh faculty of engineering , kyushu university , hakozaki , japan e. evgin department of civil engineering , university of ottawa , ontario , canada ab...
5
math.gr oct mapping class groups are not linear in positive characteristic j. o. 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 rep...
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 d...
5
counting racks of order math.co may matthew ashford and oliver may abstract rack on can be thought of as set of maps fx , where each fx is permutation of such that fy fx fy for all an. 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 upp...
4
generalized minimum distance estimators in linear regression with dependent errors math.st 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 mixin. the regression parameters are estimated thro...
10
static analysis of file-processing programs using file format specifications m. raveendra , raghavan , and s. cs.pl apr indian institute of science , bangalore and tata consultancy services ltd. , raveendra.kumar tcs.com indian institute of science , bangalore , raghavan , narendran csa.iisc.ernet.in abstrac. programs ...
6
achievability performance bounds for integer-forcing source coding elad domanovitz and uri erez cs.it dec abstract integer-forcing source coding has been proposed as low-complexity method for compression of distributed correlated gaussian source. in this scheme , each encoder quantizes its observation using the same fi...
7
position-based coding and convex splitting for private communication over quantum channels quant-ph aug mark m. march abstract the classical-input quantum-output cq wiretap channel is communication model involving classical sender , legitimate quantum receiver , and quantum eavesdropper e. the goal of private communica...
7
web-based 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 fajar.p world is connected through the interne. as the abundance of internet use...
6
qualitative assessment of recurrent human motion andre ebert , michael till beck , andy mattausch , lenz belzner , and claudia linnhoff-popien cs.lg nov mobile and distributed systems group institute for computer science ludwig-maximilians-university , munich , germany email andre.ebert ifi.lmu.de , michael.beck ifi.lm...
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 p...
5
high performance non-binary spatially-coupled codes for flash memories ahmed hareedy , homa esfahanizadeh , and lara dolecek cs.it mar electrical en. department , university of california , los angeles , los angeles , ca usa ahareedy , hesfahanizadeh ucla.edu and dolecek ee.ucla.edu dense flash memory devices operate a...
7
math.rt jan steinberg-like characters for finite simple groups gunter malle and alexandre zalesski abstrac. let be finite group and , for prime , let be sylow p-subgroup of g. character of is called sylp -regular if the restriction of to is the character of the regular representation of s. if , in addition , vanishes a...
4
stability of integral delay equations and stabilization of age-structured models iasson karafyllis and miroslav krstic dep. of mathematics , national technical university of athens , zografou campus , athens , greece , email iasonkar central.ntua.gr dep. of mechanical and aerospace eng. , university of california , san...
3
self-triggered pursuit of single evader with uncertain information saad a. aleem cs.sy jan cameron nowzari george j. pappas department of electrical systems engineering , university of pennsylvania , philadelphia , pa usa abstract this paper studies pursuit-evasion problem involving single pursuer and single evader , w...
3
diffeomorphic random sampling using optimal information transport math.na apr martin , sarang , and klas department of mathematics , florida state university bauer math.fsu.edu department of bioengineering , scientific computing and imaging institute , university of utah sjoshi sci.utah.edu department of mathematical s...
10
math.na 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 , p.. box ga delft , the netherland. department of energy resourc...
5
decoupling schemes for predicting compressible fluid flows petr n. vabishchevicha , nuclear safety institute , russian academy of sciences , b. tulskaya , moscow , russia friendship university of russia rudn university , miklukho-maklaya st. , moscow , russia cs.ce jan peoples abstract numerical simulation of compressi...
5
on-demand relational concept analysis alexandre , jessie , marianne , and giacomo , bourgogne , dijon , france lirmm , cnrs and de montpellier , montpellier france limos , clermont auvergne , clermont-ferrand , france contact alexandrebazin.com , jcarbonnel , huchard lirmm.fr , giacomo.kahn isima.fr cs.db mar abstrac. ...
2
probabilistic integration role in statistical computation , chri. j. , mark , michael a. 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 engin...
10
cointegration of the daily electric power system load and the weather s. z. stefanov eso ead , veslets str. , sofia , bulgaria szstefanov ndc.bg this paper makes thermal predictive analysis of the electric power system security for day ahea. this predictive analysis is set as thermal computation of the expected securit...
5
published as conference paper at iclr raining wide residual networks for deployment using single bit for each weight cs.lg feb mark d. mcdonnell computational learning systems laboratory cls-lab.org school of information technology and mathematical sciences university of south australia mawson lakes , sa australia mark...
9
transaction-based sandboxing for javascript technical report matthias keil and peter thiemann university of freiburg freiburg , germany keilr , thiemann informatik.uni-freiburg.de cs.pl jan abstract today javascript applications are composed of scripts from different origins that are loaded at run tim. as not all of th...
6
enumeration of groups whose order factorises in at most primes math.gr feb bettina eick february abstract let denote the number of isomorphism types of groups of order n. we consider the integers that are products of at most not necessarily distinct primes and exhibit formulas for for such n. introduction the construct...
4
asymmetric dynamics of outer automorphisms math.gr aug mark c. bell university of illinois mcbell illinois.edu march abstract we consider the action of an irreducible outer automorphism on the closure of outer spac. this action has north-south dynamics and so , under iteration , points converge exponentially t. for eac...
4
topology estimation using graphical models in multi-phase power distribution grids cs.sy 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 syste. struct...
3
math.gr jul semi-simple groups that are quasi-split over tamely-ramified extension philippe gille abstrac. let be discretly henselian field whose residue field is separably close. answering question raised by g. prasad , we show that semisimple group is quasi-split if and only if it after finite tamely ramified extensi...
4
submitted to artificial life march simple model of unbounded evolutionary versatility as largest-scale trend in organismal evolution peter d. turney institute for information technology national research council of canada ottawa , ontario , canada , peter.turney iit.nrc.ca phone fax abstract the idea that there are any...
5
cs.cr 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 cse.psu.edu united states army research laboratory adelphi , md ananthram.swami , richard.e.haran.civ mail.mil lear...
9
characterization for asymptotic dimension growth math.mg jan goulnara arzhantseva , graham a. niblo , nick wright , and jiawen zhang abstrac. we give characterization for asymptotic dimension growt. we apply it to cat cube complexes of finite dimension , giving an alternative proof of n. wright result on their finite a...
4
normalizing flows on riemannian manifolds stat.ml nov mevlana c. gemici google deepmind mevlana google.com danilo j. rezende google deepmind danilor google.com shakir mohamed google deepmind shakir google.com abstract we consider the problem of density estimation on riemannian manifold. density estimation on manifolds ...
10
math.st sep the annals of statistics vo. n. 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 recurre...
10
memcapacitive neural networks yuriy v. pershin and massimiliano di ventra cond-mat.dis-nn jul abstract we show that memcapacitive memory capacitive systems can be used as synapses in artificial neural network. as an example of our approach , we discuss the architecture of an integrate-and-fire neural network based on m...
9
minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest hung-chun hsueh-i cs.ds mar march abstract let be an n-node simple directed planar graph with nonnegative edge weight. we study the fundamental problems of computing global cut of with minimum weight and cycle of with minimum weigh. the...
8
survey of shortest-path algorithms amgad , walid g. , faizan ur , mohamed abdur , saleh purdue university , west lafayette , usa umm al-qura university , makkah , ksa cs.ds may may abstract shortest-path algorithm finds path containing the minimal cost between two vertices in grap. plethora of shortest-path algorithms ...
8
event-triggered stabilization of disturbed linear systems over digital channels math.oc jan mohammad javad khojasteh , mojtaba hedayatpour , jorge , massimo franceschetti we present an event-triggered control strategy for stabilizing scalar , continuous-time , time-invariant , linear system over digital communication c...
3
math.kt mar tate-betti and tate-bass numbers e. enochs and s. estrada and a. iacob abstrac. we define tate-betti and tate-bass invariants for modules over commutative noetherian local ring r. then we show the periodicity of these invariants provided that is hypersurfac. in case is also gorenstein , we see that finitely...
0
the rate-distortion function and excess-distortion exponent of sparse regression codes with optimal encoding paper studies the performance of sparse regression codes for lossy compression with the squared-error distortion criterio. in sparse regression code , codewords are linear combinations of subsets of columns of d...
7
the conference paper assignment problem using order weighted averages to assign indivisible goods cs.ai may jing , nicholas , renee , and toby csiro and unsw , sydney , australia renee.noble , lianjingwu gmail.com ibm t.j. watson research center , new york , usa n.mattei ibm.com csiro , unsw , and tu berlin , berlin , ...
2
math.st dec estimating monotone probability mass function with known flat regions dragi anevski and vladimir m. pastukhov centre for mathematical sciences , lund university , lund , sweden abstract we propose new estimator of discrete monotone probability mass function with known flat region. we analyse its asymptotic ...
10
sparse-to-dense depth prediction from sparse depth samples and single image cs.ro feb fangchang and sertac we consider the problem of dense depth prediction from sparse set of depth measurements and single rgb imag. since depth estimation from monocular images alone is inherently ambiguous and unreliable , to attain hi...
2
entropy rate estimation for markov chains with large state space cs.lg feb yanjun , jiantao , chuan-zheng , tsachy , yihong , tiancheng february abstract estimating the entropy based on data is one of the prototypical problems in distribution property testing and estimatio. for estimating the shannon entropy of distrib...
10
arxiv cs.ce nov predicting rna secondary structures with arbitrary pseudoknots by maximizing the number of stacking pairs samuel ming-yang tak-wah wing-kin siu-ming abstract the paper investigates the computational problem of predicting rna secondary structure. the general belief is that allowing pseudoknots makes the ...
5
estimating linear and quadratic forms via indirect observations math.st apr anatoli juditsky arkadi nemirovski abstract in this paper , we further develop the approach , originating in , to computation-friendly statistical estimation via convex programming.our focus is on estimating linear or quadratic form of an unkno...
10
math.oc apr stochastic variance reduction for nonconvex optimization sashank j. reddi sjakkamr cs.cmu.edu carnegie mellon university ahmed hefny ahefny cs.cmu.edu carnegie mellon university suvrit sra suvrit mit.edu massachusetts institute of technology bapoczos cs.cmu.edu carnegie mellon university alex smola alex smo...
9
cs.ms may automating embedded analysis capabilities and managing software complexity in multiphysics simulation part ii application to partial differential equations roger p. pawlowski , eric t. phipps , andrew g. , steven j. owen , christopher m. siefert , and matthew l. staten , sandia national april keywords generic...
5
faster algorithms for svp and cvp in the norm divesh aggarwal priyanka mukhopadhyay cs.ds jan january abstract blomer and naewe modified the randomized sieving algorithm of ajtai , kumar and sivakumar to solve the shortest vector problem sv. the algorithm starts with randomly chosen vectors in the lattice and employs s...
8
on the table of marks of direct product of finite group. math.gr feb brendan masterson and pfeiffer abstrac. we present method for computing the table of marks of direct product of finite group. in contrast to the character table of direct product of two finite groups , its table of marks is not simply the kronecker pr...
4
math.st apr merging joint distributions via causal model classes with low vc dimension dominik janzing dominik.janzing tuebingen.mpg.de planck institute for intelligent systems max-planck-ring , germany april abstract if , denote sets of random variables , two different data sources may contain samples from px , and py...
10
faster str-ic-lcs computation via rle keita kuboi yuta fujishige shunsuke inenaga hideo bannai masayuki takeda department of informatics , kyushu university , japan keita.kuboi , yuta.fujishige , inenaga , bannai , takeda inf.kyushu-u.ac.jp cs.ds mar abstract the constrained lcs problem asks one to find longest common ...
8
math.ac jun eine charakterisierung der matlis-reflexiven moduln helmut mathematisches institut der theresienst. , germany e-mail zoeschinger mathematik.uni-muenchen.de abstract let , be noetherian local ring , the injective hull of and homr , the matlis dual of the r-module m. if the canonical monomorphism is surjectiv...
0
flying insect classification with inexpensive sensors yanping chen department of computer science engineering , university of california , riverside ucr.edu adena why department of entomology , university of california , riverside ucr.edu gustavo batista university of paulo usp gbatista icmc.usp.br agenor mafra-neto is...
5
polylogarithmic approximation algorithms for weighted-f-deletion akanksha daniel pranabendu saket meirav zehavik abstract cs.ds jul let be family of graph. canonical vertex deletion problem corresponding to is defined as follows given an n-vertex undirected graph and weight function , find minimum weight subset such th...
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 acknowledge. streaming data from hdd ...
5