Search results for "LCP"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Muhammed Asfar Saeed, Masood Ur Rehman 0001	Design of an LCP-based Antenna Array for 5G/B5G Wearable Applications.	UCET	2019	DBLP DOI BibTeX RDF
21	Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.	SPIRE	2019	DBLP DOI BibTeX RDF
21	Arnab Ganguly 0002, Manish Patil, Rahul Shah 0001, Sharma V. Thankachan	A Linear Space Data Structure for Range LCP Queries.	Fundam. Informaticae	2018	DBLP DOI BibTeX RDF
21	Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles	External memory BWT and LCP computation for sequence collections with applications.	CoRR	2018	DBLP BibTeX RDF
21	V. Satheesh Kumar, S. Ramesh	LCP Based Planar High Q Embedded BandPass Filter for Wireless Applications.	J. Mobile Multimedia	2018	DBLP DOI BibTeX RDF
21	Behrouz Kheirfam, Maryam Chitsaz	Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa )\) -LCP in a wide neighborhood of the central path.	Period. Math. Hung.	2018	DBLP DOI BibTeX RDF
21	Juyoung Park, Wook Hyun, Mi-Young Huh	LCP for Managing Smart Greenhouse.	ICTC	2018	DBLP DOI BibTeX RDF
21	Paola Bonizzoni, Gianluca Della Vedova, Serena Nicosia, Yuri Pirola, Marco Previtali, Raffaella Rizzi	Divide and Conquer Computation of the Multi-string BWT and LCP Array.	CiE	2018	DBLP DOI BibTeX RDF
21	Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles	External memory BWT and LCP computation for sequence collections with applications.	WABI	2018	DBLP DOI BibTeX RDF
21	Paniz Abedin, Arnab Ganguly 0002, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah 0001, Sharma V. Thankachan	A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time.	COCOON	2018	DBLP DOI BibTeX RDF
21	Xinhan Lin, Shouyi Yin, Fengbin Tu, Leibo Liu, Xiangyu Li, Shaojun Wei	LCP: a layer clusters paralleling mapping method for accelerating inception and residual networks on FPGA.	DAC	2018	DBLP DOI BibTeX RDF
21	Felipe A. Louza, Simon Gog, Guilherme P. Telles	Optimal suffix sorting and LCP array construction for constant alphabets.	Inf. Process. Lett.	2017	DBLP DOI BibTeX RDF
21	Yi Wu 0011, Ge Nong, Wai Hong Chan, Ling Bo Han	Checking Big Suffix and LCP Arrays by Probabilistic Methods.	IEEE Trans. Computers	2017	DBLP DOI BibTeX RDF
21	Felipe A. Louza, Travis Gagie, Guilherme P. Telles	Burrows-Wheeler transform and LCP array construction in constant space.	J. Discrete Algorithms	2017	DBLP DOI BibTeX RDF
21	Keisuke Goto 0001	Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets.	CoRR	2017	DBLP BibTeX RDF
21	Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola, Marco Previtali, Raffaella Rizzi	Computing the BWT and LCP array of a Set of Strings in External Memory.	CoRR	2017	DBLP BibTeX RDF
21	Ryohei Hosono, Yusuke Uemichi, Yuta Hasegawa, Yusuke Nakatani, Kiyoshi Kobayashi, Ning Guan	Development of millimeter-wave devices based on liquid crystal polymer (LCP) substrate.	IEICE Electron. Express	2017	DBLP DOI BibTeX RDF
21	Michael Andersen, Sarah Niebe, Kenny Erleben	A Fast Linear Complementarity Problem (LCP) Solver for Separating Fluid-Solid Wall Boundary Conditions.	VRIPHYS	2017	DBLP DOI BibTeX RDF
21	Juha Kärkkäinen, Dominik Kempa	Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet.	SEA	2017	DBLP DOI BibTeX RDF
21	Sensen Li, Ming Yi, Spyridon Pavlidis, Huan Yu, Madhavan Swaminathan, John Papapolymerou	Investigation of surface roughness effects for D-band SIW transmission lines on LCP substrate.	RWS	2017	DBLP DOI BibTeX RDF
21	Osama Hussein, Khair Alshamaileh, Abhishek Sahu, Blen Keneni, Vijay Kumar Devabhaktuni	Optimization of miniaturized single- and multiband CPW-based matching transformers for RF circuitry on LCP substrates.	CCECE	2017	DBLP DOI BibTeX RDF
21	Lavinia Egidi, Giovanni Manzini	Lightweight BWT and LCP Merging via the Gap Algorithm.	SPIRE	2017	DBLP DOI BibTeX RDF
21	Yi Wu 0011, Ling Bo Han, Wai Hong Chan, Ge Nong	Scalable K-Order LCP Array Construction for Massive Data.	PAAP	2017	DBLP DOI BibTeX RDF
21	Mohamed Achache	Complexity analysis of a weighted-full-Newton step interior-point algorithm for P∗(κ)-LCP.	RAIRO Oper. Res.	2016	DBLP DOI BibTeX RDF
21	Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski	Tighter bounds for the sum of irreducible LCP values.	Theor. Comput. Sci.	2016	DBLP DOI BibTeX RDF
21	Timo Bingmann, Johannes Fischer 0001, Vitaly Osipov	Inducing Suffix and LCP Arrays in External Memory.	ACM J. Exp. Algorithmics	2016	DBLP DOI BibTeX RDF
21	Juha Kärkkäinen, Dominik Kempa	LCP Array Construction in External Memory.	ACM J. Exp. Algorithmics	2016	DBLP DOI BibTeX RDF
21	Anthony J. Cox, Fabio Garofalo, Giovanna Rosone, Marinella Sciortino	Lightweight LCP construction for very large collections of strings.	J. Discrete Algorithms	2016	DBLP DOI BibTeX RDF
21	Juha Kärkkäinen, Marcin Piatkowski, Simon J. Puglisi	String Inference from the LCP Array.	CoRR	2016	DBLP BibTeX RDF
21	Felipe A. Louza, Travis Gagie, Guilherme P. Telles	Burrows-Wheeler transform and LCP array construction in constant space.	CoRR	2016	DBLP BibTeX RDF
21	Anthony J. Cox, Fabio Garofalo, Giovanna Rosone, Marinella Sciortino	Lightweight LCP Construction for Very Large Collections of Strings.	CoRR	2016	DBLP BibTeX RDF
21	Paola Bonizzoni, Gianluca Della Vedova, Serena Nicosia, Marco Previtali, Raffaella Rizzi	A New Lightweight Algorithm to compute the BWT and the LCP array of a Set of Strings.	CoRR	2016	DBLP BibTeX RDF
21	Ljiljana Cvetkovic, Vladimir Kostic, Ernest Sanca	A wider convergence area for the MSTMAOR iteration methods for LCP.	Numer. Algorithms	2016	DBLP DOI BibTeX RDF
21	Juha Kärkkäinen, Dominik Kempa	Faster External Memory LCP Array Construction.	ESA	2016	DBLP DOI BibTeX RDF
21	Juha Kärkkäinen, Dominik Kempa	LCP Array Construction Using O(sort(n)) (or Less) I/Os.	SPIRE	2016	DBLP DOI BibTeX RDF
21	G. Q. Wang, X. J. Fan, D. T. Zhu, D. Z. Wang	New complexity analysis of a full-Newton step feasible interior-point algorithm for P∗(κ)-LCP.	Optim. Lett.	2015	DBLP DOI BibTeX RDF
21	Constantin Popa, Tobias Preclik, Ulrich Rüde	Regularized solution of LCP problems with application to rigid body dynamics.	Numer. Algorithms	2015	DBLP DOI BibTeX RDF
21	Joonsoo Jeong, So Hyun Bae, Kyou Sik Min, Jong-Mo Seo, Hum Chung, Sung June Kim	A Miniaturized, Eye-Conformable, and Long-Term Reliable Retinal Prosthesis Using Monolithic Fabrication of Liquid Crystal Polymer (LCP).	IEEE Trans. Biomed. Eng.	2015	DBLP DOI BibTeX RDF
21	Hamid Khobzi, Babak Teimourpour	LCP segmentation: A framework for evaluation of user engagement in online social networks.	Comput. Hum. Behav.	2015	DBLP DOI BibTeX RDF
21	Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski	Tighter Bounds for the Sum of Irreducible LCP Values.	CPM	2015	DBLP DOI BibTeX RDF
21	Felipe A. Louza, Guilherme P. Telles	Computing the BWT and the LCP Array in Constant Space.	IWOCA	2015	DBLP DOI BibTeX RDF
21	Amihood Amir, Moshe Lewenstein, Sharma V. Thankachan	Range LCP Queries Revisited.	SPIRE	2015	DBLP DOI BibTeX RDF
21	Florian A. Potra	Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity.	SIAM J. Optim.	2014	DBLP DOI BibTeX RDF
21	Maryam Zangiabadi, M. Sayadi Shahraki, Hossein Mansouri	A Large-Update Interior-Point Method for Cartesian P ∗(κ)-LCP Over Symmetric Cones.	J. Math. Model. Algorithms Oper. Res.	2014	DBLP DOI BibTeX RDF
21	Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat	Range LCP.	J. Comput. Syst. Sci.	2014	DBLP DOI BibTeX RDF
21	Francisco Fernandes, Ana T. Freitas	slaMEM: efficient retrieval of maximal exact matches using a sampled LCP array.	Bioinform.	2014	DBLP DOI BibTeX RDF
21	Yong-Hoon Lee, You-Young Cho, Gyeong-Mi Cho	Interior-point algorithms for P*κ -LCP based on a new class of kernel functions.	J. Glob. Optim.	2014	DBLP DOI BibTeX RDF
21	Juha Kärkkäinen, Dominik Kempa	LCP Array Construction in External Memory.	SEA	2014	DBLP DOI BibTeX RDF
21	Tie Ni, Sheng-Long Hu	A note on quadratic convergence of a smoothing Newton algorithm for the LCP.	Optim. Lett.	2013	DBLP DOI BibTeX RDF
21	Jean Sébastien Cagnone, Brian C. Vermeire, Siva K. Nadarajah	A p-adaptive LCP formulation for the compressible Navier-Stokes equations.	J. Comput. Phys.	2013	DBLP DOI BibTeX RDF
21	Simon Gog, Enno Ohlebusch	Compressed suffix trees: Efficient computation and storage of LCP-values.	ACM J. Exp. Algorithmics	2013	DBLP DOI BibTeX RDF
21	Markus J. Bauer, Anthony J. Cox, Giovanna Rosone, Marinella Sciortino	Lightweight LCP Construction for Next-Generation Sequencing Datasets	CoRR	2013	DBLP BibTeX RDF
21	Felipe A. Louza, Guilherme P. Telles, Cristina Dutra de Aguiar Ciferri	External Memory Generalized Suffix and LCP Arrays Construction.	CPM	2013	DBLP DOI BibTeX RDF
21	Moshe Lewenstein	LCP Magic.	CPM	2013	DBLP DOI BibTeX RDF
21	Joonsoo Jeong, Soowon Shin, Geun Jae Lee, Tae Mok Gwon, Jeong Hoan Park, Sung June Kim	Advancements in fabrication process of microelectrode array for a retinal prosthesis using Liquid Crystal Polymer (LCP).	EMBC	2013	DBLP DOI BibTeX RDF
21	Timo Bingmann, Johannes Fischer 0001, Vitaly Osipov	Inducing Suffix and Lcp Arrays in External Memory.	ALENEX	2013	DBLP DOI BibTeX RDF
21	Manish Patil, Rahul Shah 0001, Sharma V. Thankachan	Faster Range LCP Queries.	SPIRE	2013	DBLP DOI BibTeX RDF
21	Lipu Zhang, Yanqin Bai, Yinghong Xu	A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function.	Numer. Algorithms	2012	DBLP DOI BibTeX RDF
21	Evan M. Drumwright, Dylan A. Shell	Extensive analysis of Linear Complementarity Problem (LCP) solver performance on randomly generated rigid body contact problems.	IROS	2012	DBLP DOI BibTeX RDF
21	Markus J. Bauer, Anthony J. Cox, Giovanna Rosone, Marinella Sciortino	Lightweight LCP Construction for Next-Generation Sequencing Datasets.	WABI	2012	DBLP DOI BibTeX RDF
21	Wen-Li Yao, Lu-Lu Gao, Yong-Sheng Ren	Modeling for dynamics of rigid-body systems with friction by linear complementary problem (LCP).	Comput. Math. Appl.	2011	DBLP DOI BibTeX RDF
21	Johannes Fischer 0001	Inducing the LCP-Array	CoRR	2011	DBLP BibTeX RDF
21	Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat	Range LCP.	ISAAC	2011	DBLP DOI BibTeX RDF
21	Johannes Fischer 0001	Inducing the LCP-Array.	WADS	2011	DBLP DOI BibTeX RDF
21	Simon Gog, Enno Ohlebusch	Fast and Lightweight LCP-Array Construction Algorithms.	ALENEX	2011	DBLP DOI BibTeX RDF
21	Johannes Fischer 0001	Wee LCP.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
21	Pierre Châtel, Isis Truck, Jacques Malenfant	LCP-Nets: A Linguistic Approach for Non-functional Preferences in a Semantic SOA Environment.	J. Univers. Comput. Sci.	2010	DBLP DOI BibTeX RDF
21	Simon Gog, Enno Ohlebusch	Lightweight LCP-Array Construction in Linear Time	CoRR	2010	DBLP BibTeX RDF
21	Panos M. Pardalos	LCP: Pardalos-Rosen Mixed Integer Formulation.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Mixed integer problem, Minimum norm solution, Mixed integer programming, Linear complementarity problem, Bimatrix games
21	Florian A. Potra, Josef Stoer	On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP.	SIAM J. Optim.	2009	DBLP DOI BibTeX RDF
21	Chao Zhang, Xiaojun Chen 0001, Naihua Xiu	Global error bounds for the extended vertical LCP.	Comput. Optim. Appl.	2009	DBLP DOI BibTeX RDF
21	Johannes Fischer 0001	Wee LCP	CoRR	2009	DBLP BibTeX RDF
21	Gustavo Arechavaleta, Efraín Lopez-Damian, Jose Luis Morales	On the use of iterative LCP solvers for dry frictional contacts in grasping.	ICAR	2009	DBLP BibTeX RDF
21	Katsu Yamane, Yoshihiko Nakamura	A Numerically Robust LCP Solver for Simulating Articulated Rigid Bodies in Contact.	Robotics: Science and Systems	2008	DBLP BibTeX RDF
21	Florian A. Potra	A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O(ÖnL)-iteration complexity.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 49M15, 65K05, 90C33
21	Mohit Pathak, Souvik Mukherjee, Madhavan Swaminathan, Ege Engin, Sung Kyu Lim	Placement and routing of RF embedded passive designs in LCP substrate.	ICCD	2007	DBLP DOI BibTeX RDF
21	Jie Sun 0001, Zheng-Hai Huang	A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution.	Optim. Methods Softw.	2006	DBLP DOI BibTeX RDF
21	Wenbao Ai, Shuzhong Zhang	An O(\sqrtn L) Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP.	SIAM J. Optim.	2005	DBLP DOI BibTeX RDF
21	Laura Frisk, Eero Ristolainen	Flip chip attachment on flexible LCP substrate using an ACF.	Microelectron. Reliab.	2005	DBLP DOI BibTeX RDF
21	Florian A. Potra	A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity.	Math. Program.	2004	DBLP DOI BibTeX RDF	large neighbourhood, linear complementarity problem, interior-point algorithm, superlinear convergence
21	Liping Zhang, Ziyou Gao	Quadratic one-step smoothing Newton method for P0-LCP without strict complementarity.	Appl. Math. Comput.	2003	DBLP DOI BibTeX RDF
21	Liping Zhang, Xiangsun Zhang	Global Linear and Quadratic One-step Smoothing Newton Method for P0-LCP.	J. Glob. Optim.	2003	DBLP DOI BibTeX RDF
21	Naihua Xiu, Jianzhong Zhang 0001	Identification of the Optimal Active Set in a Noninterior Continuation Method for LCP.	J. Glob. Optim.	2003	DBLP DOI BibTeX RDF
21	Keisuke Hotta, Akiko Yoshise	A Complexity Bound of a Predictor-Corrector Smoothing Method Using CHKS-Functions for Monotone LCP.	Comput. Optim. Appl.	2002	DBLP DOI BibTeX RDF
21	Jianzhong Zhang 0001, Naihua Xiu	New projection-type methods for monotone LCP with finite termination.	Numerische Mathematik	2002	DBLP DOI BibTeX RDF
21	Masakazu Kojima, Levent Tunçel	Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems.	J. Glob. Optim.	2002	DBLP DOI BibTeX RDF
21	Clóvis C. Gonzaga	Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path.	SIAM J. Optim.	1999	DBLP DOI BibTeX RDF
21	Song Xu 0001, James V. Burke	A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques.	Math. Program.	1999	DBLP DOI BibTeX RDF
21	Glen Zorn	PPP LCP Internationalization Configuration Option.	RFC	1999	DBLP DOI BibTeX RDF
21	Florian A. Potra, Rongqin Sheng	A path following method for LCP withsuperlinearly convergent iteration sequence.	Ann. Oper. Res.	1998	DBLP DOI BibTeX RDF
21	Rongqin Sheng, Florian A. Potra	A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity.	SIAM J. Optim.	1997	DBLP DOI BibTeX RDF
21	Florian A. Potra, Rongqin Sheng	A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP.	SIAM J. Optim.	1997	DBLP DOI BibTeX RDF
21	Florian A. Potra	AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence.	Ann. Oper. Res.	1996	DBLP DOI BibTeX RDF
21	Renato D. C. Monteiro, Stephen J. Wright 0001	A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP.	SIAM J. Optim.	1996	DBLP DOI BibTeX RDF
21	Kevin A. McShane	On the Superlinear Convergence of an O(n3 L) Interior-Point Algorithm for the Monotone LCP.	SIAM J. Optim.	1996	DBLP DOI BibTeX RDF
21	Florian A. Potra, Rongqin Sheng	Predictor-corrector algorithm for solving P*(k)-matrix LCP from arbitrary positive starting points.	Math. Program.	1996	DBLP DOI BibTeX RDF
21	Yinyu Ye 0001	On homogeneous and self-dual algorithms for LCP.	Math. Program.	1996	DBLP DOI BibTeX RDF
21	Renato D. C. Monteiro, Stephen J. Wright 0001	Superlinear primal-dual affine scaling algorithms for LCP.	Math. Program.	1995	DBLP DOI BibTeX RDF
21	Renato D. C. Monteiro, Stephen J. Wright 0001	Local convergence of interior-point algorithms for degenerate monotone LCP.	Comput. Optim. Appl.	1994	DBLP DOI BibTeX RDF
21	Walter D. Morris Jr.	LCP Degree Theory and Oriented Matroids.	SIAM J. Matrix Anal. Appl.	1994	DBLP DOI BibTeX RDF