31,956 Hits in 11.8 sec

Extended Abstracts

2010 Cartilage  
Organization, Japan, and Grantin-Aid for Scientific Research (B), Japan Society for the promotion of Science, Japan.  ...  Dhert Utrecht/Netherlands Utrecht/Netherlands Acknowledgments: Funding from the AO foundation, the Dutch Technology Foundation STW, Applied Science Division of NWO and the Technology Program of the Ministry  ...  2007 extended ICRS abstract on the topic.1 The term applies to resurfacing either one unicompartmental knee replacement since the 2007 extended ICRS 22s 22s Extended Abstracts 16.1.1 16.1.1 Biologic  ... 
doi:10.1177/1947603510386038 pmid:26075041 pmcid:PMC4300817 fatcat:m2mv3tnf6vhzndubvwdtltkh5y

Genus and the geometry of the cut graph: [extended abstract] [chapter]

James R. Lee, Anastasios Sidiropoulos
2010 Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms  
Using these geometric primitives, we present exponentially improved dependence on genus for a number of problems like approximate max-flow/mincut theorems, approximations for uniform and nonuniform Sparsest  ...  Cut, treewidth approximation, Laplacian eigenvalue bounds, and Lipschitz extension theorems and related metric labeling problems.  ...  We remark that the set of cycles in a system of loops is a set of generators for the fundamental group π 1 (S, x).  ... 
doi:10.1137/1.9781611973075.18 dblp:conf/soda/LeeS10 fatcat:ykjbuujnyzemxdjiur2ixfui4y

Strongly typed flow-directed representation transformations (extended abstract)

Allyn Dimock, Robert Muller, Franklyn Turbak, J. B. Wells
1997 Proceedings of the second ACM SIGPLAN international conference on Functional programming - ICFP '97  
The framework is based on these techniques: 1. Flow annotated types encode the "flows-from" (source) and "flows-to" (sink) information of a flow graph. 2.  ...  As an instance of our framework, we provide a function representation transformation that encompasses both closure conversion and inlining. Our framework is adaptable to data other than functions.  ...  We would also like to thank our fellow Church Project members for their support and encouragement, especially Assaf Kfoury and Glenn Holloway.  ... 
doi:10.1145/258948.258952 dblp:conf/icfp/DimockMTW97 fatcat:oj64s4pzm5h63myueryrz2s5lu

2.5D modelling of elastic waves in anisotropic media using the spectral-element method ? a preliminary investigation

Catherine Sinclair, Stewart Greenhalgh, Bing Zhou
2006 ASEG Extended Abstracts  
The spectral-element method provides an accurate alternative to the finite-element method for modelling elastic waves in anisotropic media.  ...  With the aim of reducing the overheads we have implemented 2.5-D spectral-element modelling of elastic waves, initially for vertically transversely isotropic (VTI) media.  ...  Zhou, B., and Greenhalgh, S., 2004, On the computation of elastic wave group velocities for a general anistropic medium: Journal of Geophysics and Engineering, 1, 205-215.  ... 
doi:10.1071/aseg2006ab163 fatcat:hopl6u7i2vfyjngqy4zera3luy

Variability Abstractions: Trading Precision for Speed in Family-Based Analyses (Extended Version) [article]

Aleksandar S. Dimovski, Claus Brabrand, Andrzej Wąsowski
2015 arXiv   pre-print
Family-based (lifted) data-flow analysis for Software Product Lines (SPLs) is capable of analyzing all valid products (variants) without generating any of them explicitly.  ...  We implement the transformation in a tool, reconfigurator that works on Object-Oriented Java program families, and evaluate the practicality of this approach on three Java SPL benchmarks.  ...  Consider a product line where two disjoint groups of products share the same code base: one group is correctness critical, the other comprises correctness non-critical products.  ... 
arXiv:1503.04608v1 fatcat:xi5wlke3tvg4tk4yqtdg65c364

Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) [article]

Erik D. Demaine, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers
2010 arXiv   pre-print
and one operation that destroys all tiles of a particular type (e.g., an RNAse enzyme destroys all RNA tiles).  ...  We consider a model of algorithmic self-assembly of geometric shapes out of square Wang tiles studied in SODA 2010, in which there are two types of tiles (e.g., constructed out of DNA and RNA material)  ...  Rothemund and Erik Winfree, The program-size complexity of self-assembled squares (extended abstract), STOC '00: Proceedings of the thirty-second annual ACM Symposium on Theory of Computing (New York  ... 
arXiv:1004.4383v2 fatcat:wqb5y2seqfcldm4kyotwsamk6m

Recognizing Seatbelt-Fastening Behavior with Wearable Technology and Machine Learning

Jake Leland, Ellen Stanfill, Josh Cherian, Tracy Hammond
2021 Extended Abstracts of the 2021 CHI Conference on Human Factors in Computing Systems  
Of course, the practicality of wearable technology depends on activity recognition-the models and algorithms which are used to identify a pattern of sensor data as a particular physical activity (e.g.  ...  Thanks to wearable technology's ease of use and convenient integration with mobile phones, users are quick to adopt.  ...  on the effectiveness of the algorithm.  ... 
doi:10.1145/3411763.3451705 fatcat:4mdbhy4ldjhkvg7pfi6pbaldsi

Grand challenges: companies and universities working for a better society (Extended Abstracts)

2021 Sinergie Italian Journal of Management  
Gli Extended Abstract racconti in questo volume affrontano la tematica con una varietà di argomenti, punti di vista, prospettive.  ...  A critical review of the empirical literature based on econometric methods", Journal of Cleaner Production, vol. 112, n. 4, pp. 2158Production, vol. 112, n. 4, pp. -2170.  ...  ., JONKER J. (2018), "Embracing the variety of sustainable business models: A prolific field of research and a future research agenda", Journal of cleaner production, vol. 194, pp. 695-703.  ... 
doi:10.7433/srecp.ea.2020.01 fatcat:7tu5ulmovbauzc744x5nxjx2by

Towards Deep Player Behavior Models in MMORPGs

Johannes Pfau, Jan David Smeddinck, Rainer Malaka
2018 The Annual Symposium on Computer-Human Interaction in Play Extended Abstracts - CHI PLAY '18  
Data analysis and individual reports indicate that deep learning can be employed to provide adequate models of individual player behavior with high accuracy for predicting skill-use and a high correlation  ...  Problems in balancing and error-coping accumulate.  ...  of Bremen (, subproject H2 "Mining and Explicating Instructions for Everyday Activities", as well as by the German Federal Ministry of Education and Research (BMBF) through the  ... 
doi:10.1145/3242671.3242706 dblp:conf/chiplay/PfauSM18 fatcat:lgo7mist2vcr7pg5qjd4ai7lwe

Black Box White Arrow [article]

Alexandre Borovik, Şükrü Yalçinkaya
2014 arXiv   pre-print
One of the advantages of our approach is that it allows us to work in black box groups over finite fields of big characteristic.  ...  As an example of application of this technique, we construct Frobenius maps on black box groups of untwisted Lie type in odd characteristic (Section 6) and inverse-transpose automorphisms on black box  ...  Pak, On sampling generating sets of finite groups and product replacement algorithm (extended abstract), Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation  ... 
arXiv:1404.7700v2 fatcat:7fgyuby7bzf6zjfkmuibv7kfzm

List Decoding Group Homomorphisms Between Supersolvable Groups

Alan Guo, Madhu Sudan, Marc Herbstritt
2014 International Workshop on Approximation Algorithms for Combinatorial Optimization  
We show that the set of homomorphisms between two supersolvable groups can be locally list decoded up to the minimum distance of the code, extending the results of Dinur et al who studied the case where  ...  the groups are abelian.  ...  In particular, one merely needs to find the correct way to generalize the algorithms (replacing the direct product presentation of G with a polycyclic presentation) and verifying that the same analysis  ... 
doi:10.4230/lipics.approx-random.2014.737 dblp:conf/approx/GuoS14 fatcat:dlsnd24zjbdxti2tzfxgswceou

List decoding group homomorphisms between supersolvable groups [article]

Alan Guo, Madhu Sudan
2014 arXiv   pre-print
We show that the set of homomorphisms between two supersolvable groups can be locally list decoded up to the minimum distance of the code, extending the results of Dinur et al who studied the case where  ...  the groups are abelian.  ...  In particular, one merely needs to find the correct way to generalize the algorithms (replacing the direct product presentation of G with a polycyclic presentation) and verifying that the same analysis  ... 
arXiv:1404.4273v1 fatcat:t2kvapripbefxc66m2b4bcykcm

Abstracts of Theses

1962 Canadian mathematical bulletin  
The sampling method investigated is that of sampling without replacement from a finite population with probabilities proportional to a measure of size.  ...  As a side result, N it is shown that if n = 2 sampling with pps without replacement is preferable to the corresponding design with replacement. John D. Dixon, On general group extensions.  ... 
doi:10.1017/s0008439500026114 fatcat:ypo6x63pifepbj62qg7o6ut6ia

Generalized Learning Problems and Applications to Non-commutative Cryptography [chapter]

Gilbert Baumslag, Nelly Fazio, Antonio R. Nicolosi, Vladimir Shpilrain, William E. Skeith
2011 Lecture Notes in Computer Science  
We propose a generalization of the learning parity with noise (LPN) and learning with errors (LWE) problems to an abstract class of group-theoretic learning problems that we term learning homomorphisms  ...  This class of problems contains LPN and LWE as special cases, but is much more general.  ...  We are grateful to Hugo Krawczyk for suggesting a cleaner acronym for our generalized learning assumption.  ... 
doi:10.1007/978-3-642-24316-5_23 fatcat:wkjte6unwjfhrdrxcqy6u4bqwy

Sharp Total Variation Bounds for Finitely Exchangeable Arrays [article]

Alexander Volfovsky, Edoardo Airoldi
2016 arXiv   pre-print
We then derive sharp bounds on the total variation distance between distributions of finitely and infinitely exchangeable arrays.  ...  In this article we demonstrate the relationship between finitely exchangeable arrays and finitely exchangeable sequences.  ...  Algorithm 1 assumes the generating set of the group G is known and outputs all the orbits of X and is based on Algorithm I.4 of Hulpke (2010) .  ... 
arXiv:1407.6092v3 fatcat:3u5pw2mgu5de5jpfj4bxjvj2wa
« Previous Showing results 1 — 15 out of 31,956 results