γλώσσες
Σελίδες
Νομικός
Explore all categories to find your favorite topic
77 Professional paper MIDEM Society Journal of Microelectronics Electronic Components and Materials Vol 44 No 1 2014 75 – 83 A Novel Topology of Variable Gain Distributed…
Slide 1 Design and Analysis of Algorithms - Chapter 11 Σχεδίαση Αλγορίθμων www.aw-bc.com/info/levitin/ Introduction to the Design and Analysis of Algorithms…
Outlier Detection with Dirichlet Process Mixtures Matthew S. Shotwell1 Elizabeth H. Slate2 Vanderbilt University1 Medical University of South Carolina2 August 3, 2011 Dirichlet…
Distributed by: wwwestudyindiacom Automata 13 The number of states in a minimal deterministic finite automaton corresponding to the language L = { an n≥4 } is A 3 B 4 C…
Process log Status of working Monitor data during EP & Rinsing process Comparison of EP2 Period : 2011/4/19 ~ 4/21 Process : EP1(100μm, 50mA/cm2), Normal 1st Water Rinsing…
Slide 1 Process log Status of working Monitor data during EP & Rinsing process Comparison of EP1 Period : 2012/2/23 ~ 2/27 Process : Degreasing (FM-20,…
Runtime Analysis of Population-based Evolutionary Algorithms1 Per Kristian Lehre School of Computer Science University of Nottingham United Kingdom IEEE CEC2015 Sendai, Japan,…
1. Runtime Analysis of Population-based Evolutionary Algorithms1 Per Kristian Lehre School of Computer Science University of Nottingham United Kingdom IEEE CEC2015 Sendai,…
Chandra Chekuri, Nitish Korula and Martin Pal Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 08) Improved Algorithms for Orienteering…
Efficient algorithms for (δ,γ,α)-matching Szymon Grabowski Computer Engineering Dept., Tech. Univ. of Łódź, Poland [email protected] PSC, Prague, August 2006 Kimmo…
Near Optimal Streaming algorithms for Graph Spanners Surender Baswana IIT Kanpur Graph spanner : a subgraph which is sparse and still preserves all-pairs approximate distances.…
Damien STEHLÉ Lattice Reduction: Problems and Algorithms Ecrypt Summer School on Cryptanalysis Plan of the talk. • Algorithmic lattice problems: γ-SVP,
Fast Rank Algorithms Based on Multiscale HistogramsFast Rank Algorithms Based on Multiscale Histograms Maria V. Storozhilova, Dmitry V. Yurin Faculty of Computational Mathematics
Norm Matloff, University of California, Davis fX(t) = ce−0.5(t−µ)′Σ−1(t−µ) library(MASS) x
Algorithms and Data Structures - Sorting 2Marcin Sydow Stability of Sorting Algorithms Quick Sort Is it possible to sort faster than with Θ(n · log(n)) complexity?
Joydeep Ghosh [email protected] – p.1/?? Squared loss is not appropriate in many situations Sparse, high-dimensional data What distortion/loss functions make sense,
Geant4 HCAL Sampling FactorsOn behalf of the CMS Collaboration November 11, 2015 High-Luminosity LHC ‹μ› = 21 ‹μ› = 50 ‹μ›
MeanEstimationYassine Hamoudi UC Berkeley Experiment with unknown outcome distribution D = (px)x Probability Outcome μ ε(n) Complexity parameter: number of times
Signal Reconstruction Algorithms on Graphical Processing UnitsSangkyun Lee† and Stephen J. Wright †[email protected] Oct. 11, 2009 5 Conclusion Problems of
Bahman Bahmani?, Ashish Goel??, and Kamesh Munagala? ? ? Abstract. In this paper, we obtain improved algorithms for two graph- theoretic problems in the popular MapReduce