Split (3)

train · 28.4k rows

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

Subsets and Splits

No community queries yet

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