نتایج جستجو برای: marek
تعداد نتایج: 1132 فیلتر نتایج به سال:
Title: “D13.6: Privacy modelling and identity” Author: WP13 Editors: Marek Kumpošt (MU, Czech Republic) Vashek Matyáš (MU, Czech Republic) Stefan Berthold (TU Dresden, Germany) Reviewers: Hans Buitelaar (Tilburg U., Netherlands) Claudia Diaz (COSIC, KU Leuven) Identifier: D13.6 Type: [Deliverable-Report] Version: 1.0 Date: Thursday, 22 November 2007 Status: [Final] Class: [Public] File: fidis-w...
Sven Aerts1,∗, Paul Kwiat2,†, Jan-Åke Larsson3,‡, and Marek Żukowski 4,§ Fundamenten van de Exacte Wetenschappen, Vrije Universiteit Brussel, Triomflaan 2, 1050 Brussel, Belgium 2 P-23, MS-H803, Los Alamos National Laboratory, Los Alamos 87545, USA Matematiska Institutionen, Linköpings Universitet, SE-581 83 Linköping, Sweden Instytut Fizyki Teoretycznej i Astrofizyki Uniwersytet Gdański, PL-80...
Citation Gurrera, Ronald J., Motoaki Nakamura, Marek Kubicki, Chandlee C. Dickey, Margaret A. Niznikiewicz, Martina M. Voglmaier, Larry J. Seidman, Carl-Fredrik Westin, Stephan E. Maier, Robert W. McCarley, and Martha E. Shenton. 2007. “The Uncinate Fasciculus and Extraversion in Schizotypal Personality Disorder: A Diffusion Tensor Imaging Study.” Schizophrenia Research 90, nos. 1-3: 360–362. d...
Nocardiosis in a Patient with Acute Necrotizing Pancreatitis. Can A Simple Microscope Specimen Save a Patient’s Life? A Case Report Krzysztof Madej1*, Hanna Tomczak2 and Marek Karczewski1 1Department of Transplantology, General and Vascular Surgery, Clinical Hospital of Poznan University of Medical Sciences, Poland 2Central Laboratory of Microbiology, Clinical Hospital of Poznan University of M...
GUOWU YANG1, XIAOYU SONG2, WILLIAM N. N. HUNG2,3,* AND MAREK A. PERKOWSKI2 School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 610054, China Department of Electrical and Computer Engineering, Portland State University, Portland, OR 97207, USA Synplicity Inc., Sunnyvale, CA 94086, USA *Corresponding author: [email protected]...
We develop a simple linear time algorithm to determine if a collection of two pin nets can be routed, topologically, in a plane (i.e. single layer). Experiments indicate that this algorithm is faster than the linear time algorithm of Marek-Sadowska and Tarngg1].
http://dx.doi.org/10.1016/j.foreco.2015.03.052 0378-1127/ 2015 Elsevier B.V. All rights reserved. ⇑ Corresponding author. E-mail addresses: [email protected] (F. Vodde), [email protected] (K. Jõgiste), [email protected] (J. Engelhart), [email protected] (L.E. Frelich), [email protected] (W.K. Moser), [email protected] (A. Sims), [email protected] (M. Metslaid). Floor Vodde a,⇑,...
Grzegorz Litak1,2∗, Marek Borowiec1,∗∗, and Arkadiusz Syta3,∗∗∗ 1 Department of Applied Mechanics, Technical University of Lublin, Nadbystrzycka 36, PL-20-618 Lublin, Poland 2 Institut für Mechanik und Mechatronik, Technische Universität Wien, Wiedner Hauptstraβe 8 10 A-1040 Wien, Austria 2 Department of Applied Mathematics, Technical University of Lublin, Nadbystrzycka 36, PL-20-618 Lublin, Po...
Karpinski and Nekrich (2008) introduced the problem of parameterized range majority, which asks us to preprocess a string of length n such that, given the endpoints of a range, one can quickly find all the distinct elements whose relative frequencies in that range are more than a threshold τ . Subsequent authors have reduced their time and space bounds such that, when τ is fixed at preprocessin...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید