24,029 Hits in 8.7 sec

Adaptive local surface refinement based on LR NURBS and its application to contact

Christopher Zimmermann, Roger A. Sauer
2017 Computational Mechanics  
A novel adaptive local surface refinement technique based on Locally Refined Non-Uniform Rational B-Splines (LR NURBS) is presented.  ...  LR NURBS can model complex geometries exactly and are the rational extension of LR B-splines.  ...  The basis function in one parametric direction of an LR NURBS element Γ e within the knot span ξ can be expressed in terms of a set of Bernstein polynomials B(ξ) and a linear operator c e a .  ... 
doi:10.1007/s00466-017-1455-7 fatcat:b3dkxfr6ujg43lk3iao35lqqum

Constant Time Simulation of an R-Mesh on an LR-Mesh

Carlos Alberto Cordova-Flores, Jose Alberto Fernandez-Zepeda, Anu G. Bourgeois
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
In other words, the LR-Mesh can simulate a step of the R-Mesh in constant time with a polynomial increase in size. This simulation is based on Reingold's algorithm to solve USTCON in log-space.  ...  This paper presents a constant time simulation of an R-Mesh on an LR-Mesh (a restricted model of the R-Mesh), proving that in spite of the differences, the two models possess the same complexity.  ...  The LR-Mesh needs two rows of processors to embed one row of the MIN; assume that the source vertex is j and the destination vertex is k.  ... 
doi:10.1109/ipdps.2007.370459 dblp:conf/ipps/Cordova-FloresFB07 fatcat:moq444q7m5cmveivbocsow6xm4


Youssouf Chherawala, Robert Wisnovsky, Mohamed Cheriet
2011 Proceedings of the 2011 Workshop on Historical Document Imaging and Processing - HIP '11  
The value of i is selected according to a predetermined lexicon-reduction accuracy. The proposed framework has been tested on a database of pre-modern Arabic subword shapes with promising results.  ...  Automatic recognition of Arabic words is a challenging task and its complexity increases as the lexicon grows.  ...  The authors would like to thank NSERC of Canada for their financial support.  ... 
doi:10.1145/2037342.2037345 dblp:conf/icdar/ChherawalaWC11 fatcat:xcmukoeb6jcunjcr7xo4xrxqre

Optimal minimum-delay/area zero-skew clock tree wire-sizing in pseudo-polynomial time

Jeng-Liang Tsai, Tsung-Hao Chen, Charlie Chung-Ping Chen
2003 Proceedings of the 2003 international symposium on Physical design - ISPD '03  
In this paper, we present an -optimal zero-skew wire-sizing algorithm, ClockTune, which guarantees zero-skew with delay and area within distance to the optimal solutions in pseudo-polynomial time.  ...  ClockTune is available on the web [13].  ...  , lv ll , lv lr , and lv l only.  ... 
doi:10.1145/640000.640036 dblp:conf/ispd/TsaiCC03 fatcat:7qby65yfwvfedipkgbozfuhbny

Optimal minimum-delay/area zero-skew clock tree wire-sizing in pseudo-polynomial time

Jeng-Liang Tsai, Tsung-Hao Chen, Charlie Chung-Ping Chen
2003 Proceedings of the 2003 international symposium on Physical design - ISPD '03  
In this paper, we present an -optimal zero-skew wire-sizing algorithm, ClockTune, which guarantees zero-skew with delay and area within distance to the optimal solutions in pseudo-polynomial time.  ...  ClockTune is available on the web [13].  ...  , lv ll , lv lr , and lv l only.  ... 
doi:10.1145/640033.640036 fatcat:lxy65tasyncj3jihzpc47toqey

User Selection Criteria for Multiuser Systems With Optimal and Suboptimal LR Based Detectors

Jinho Choi, Fumiyuki Adachi
2010 IEEE Transactions on Signal Processing  
We also show that the ML and even some low complexity suboptimal detectors (based on the lattice reduction (LR)) can achieve a full multiuser and receive diversity when the user selection criterion is  ...  If the LR basis is not used, U ex = I (i.e., G ex = H ex ). Note that the size of Gex is the same as that of Hex which is 2N2Q.  ...  IMPACT OF THE NUMBER OF USERS ON DIVERSITY GAIN To see the impact of the number of users on the diversity gain for each user selection criterion, we consider the error probabilities of the ML and LR based  ... 
doi:10.1109/tsp.2010.2053361 fatcat:bist5zagcbhcnepav6d6ucxs3q

On the similarities and differences between Classical Hierarchical, Truncated Hierarchical and LR B-splines

Kjetil André Johannessen, Filippo Remonato, Trond Kvamsdal
2015 Computer Methods in Applied Mechanics and Engineering  
maximum dimension of the space of bivariate piecewise polynomials of degrees (p, q) with continuity (k, l) along element edges is given by S = (p + 1) (q + 1) F − (p + 1) (l + 1) H − (q + 1)  ...  u = b ⇒ A + k 2 M u = b  ... 
doi:10.1016/j.cma.2015.02.031 fatcat:i3cdktv3dvfibgcdtf4fh4g5hm

Learning symmetric k-juntas in time n^o(k) [article]

Mihail N. Kolountzakis, Evangelos Markakis, Aranyak Mehta
2005 arXiv   pre-print
We give an algorithm for learning symmetric k-juntas (boolean functions of n boolean variables which depend only on an unknown set of k of these variables) in the PAC model under the uniform distribution  ...  Our bound is obtained by proving the following result: Every symmetric boolean function on k variables, except for the parity and the constant functions, has a non-zero Fourier coefficient of order at  ...  Note that we allow the running time to be polynomial in 2 k , since this is the size of the truth-table which is output. In the typical setting of k = O(log n), this becomes polynomial in n.  ... 
arXiv:math/0504246v1 fatcat:qag5d25mmrgnrb46ledhr4jjyq

Estimation of covariance components between one continuous and one binary trait

H Simianer, LR Schaeffer
1989 Genetics Selection Evolution  
The impact of small subclass size on the estimates is seen to be a serious drawback to the proposed method.  ...  This leads to a nonlinear system of equations similar to the mixed model equations for observations that have been transformed by a Cholesky decomposition of the residual variance-covariance matrix so  ...  Simianer was visiting the University of Guelph, supported by the Deutsche Forschungsgemeinschaft.  ... 
doi:10.1186/1297-9686-21-3-303 fatcat:ld2jxfo27bb3bfhgewbf5ow2zy

Permutation-equivariant quantum K-theory I. Definitions. Elementary K-theory of M_0,n/S_n [article]

Alexander Givental
2015 arXiv   pre-print
With this article, we begin a series of publications on K-theoretic Gromov-Witten invariants, cognizant of the S_n-module structure on the sheaf cohomology, induced by renumbering of the marked points.  ...  K-theoretic Gromov-Witten invariants of a compact Kahler manifold X are defined as super-dimensions of sheaf cohomology of interesting bundles over moduli spaces of n-pointed holomorphic curves in X.  ...  The trace tr c k S * q (C k ) can be computed as k s=1 (1 − e 2πis/k q) −1 = (1 − q k ) −1 , since e 2πis are simple eigenvalues of c k on C k . Taking in account the size n!/ k l k !  ... 
arXiv:1508.02690v1 fatcat:c3bm6rgjlfhtlmmsbmr25vfhl4

A novel nonsymmetric K−-Lanczos algorithm for the generalized nonsymmetric K−-eigenvalue problems

William R. Ferng, Kun-Yi Lin, Wen-Wei Lin
1997 Linear Algebra and its Applications  
L have the so-called K +-structures.  ...  We demonstrate a K_-tridiagonalization procedure preserves the K *-structures. An error bound for the extreme K-Ritz value obtained from this new algorithm is presented.  ...  Hereinafter 9"k is the set of polynomials of degree less than or equal to k.  ... 
doi:10.1016/s0024-3795(96)00670-2 fatcat:3arzasmvfndxfdvcj4salovgry

An Improved LR-aided K-Best Algorithm for MIMO Detection [article]

Qi Zhou, Xiaoli Ma
2013 arXiv   pre-print
To enhance the performance of the LR-aided detectors, the LR-aided K-best algorithm was developed at the cost of the extra complexity on the order O(N_t^2 K + N_t K^2), where N_t is the number of transmit  ...  The low complexity of the proposed LR-aided K-best algorithm allows us to perform the algorithm for large MIMO systems (e.g., 50x50 MIMO systems) with large candidate sizes.  ...  ACKNOWLEDGMENT Part of the work is supported by ARO Grant DAAD W911NF-11-1-0542.  ... 
arXiv:1304.1066v1 fatcat:avobx3n3lnhbtf2xfprn3ydnie

Dial a Ride from k-forest [article]

Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
2007 arXiv   pre-print
In this paper, we give an O({√(n),√(k)})-approximation algorithm for k-forest, improving on the previous best ratio of O(n^2/3 n) by Segev & Segev.  ...  The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems.  ...  Note that |O l,j | equals the number of demands in G j carried over edge (lr − 1, lr) by tour σ, which is at most k.  ... 
arXiv:0707.0648v1 fatcat:el6yol2ydjblli2edeqjthh2hq

Search for resonant B±→K±h→K±γγ decays at Belle

J. Wicht, I. Adachi, H. Aihara, D. Anipko, V. Aulchenko, T. Aushev, A.M. Bakich, E. Barberio, I. Bedny, U. Bitenc, I. Bizjak, A. Bondar (+135 others)
2008 Physics Letters B  
We report measurements and searches for resonant B^±→ K^± h → K^±γγ decays where h is a η,η^',η_c,η_c(2S),χ_c0,χ_c2,J/ψ meson or the X(3872) particle.  ...  Acknowledgements We thank the KEKB group for the excellent operation of the accelerator, the KEK cryogenics group for the efficient oper-  ...  We use different LR cuts depending on the flavor tagging information.  ... 
doi:10.1016/j.physletb.2008.03.029 fatcat:ygqugsjr55e3jg2skdg7nkvbhq

Line-Broadcasting in Complete k-Trees [article]

Revital Hollander Shabtai, Yehuda Roditty
2015 arXiv   pre-print
In this paper, we present lower and upper bounds for the cost to broadcast one message in a complete k-tree, from any vertex using the line-broadcasting model.  ...  A line-broadcasting model in a connected graph G=(V,E), |V|=n, is a model in which one vertex, called the originator of the broadcast holds a message that has to be transmitted to all vertices of the graph  ...  The execution of the procedure F romLevel at the second round takes one unit of time, and the broadcast from the vertices in Lr−1 to the vertices in Lr takes ⌈log2 (k + 1)⌉ time units, which is the total  ... 
arXiv:1504.02491v1 fatcat:qsrvqnrxtzdjzc5jkh5ibzuddi
« Previous Showing results 1 — 15 out of 24,029 results