Filters








28,473 Hits in 5.4 sec

Fine-grained reductions from approximate counting to decision

Holger Dell, John Lapinskas
2018 Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018  
In this paper, we introduce a general framework for fine-grained reductions of approximate counting problems to their decision versions.  ...  We also provide a fine-grained reduction from approximate #SAT to SAT. Suppose the Strong Exponential Time Hypothesis (SETH) is false, so that for some 1 0 as part of the input).  ...  All known reductions from approximate counting to decision in this setting suffer from a common issue.  ... 
doi:10.1145/3188745.3188920 dblp:conf/stoc/DellL18 fatcat:gzozgnb4ejexzioaivewqmxggm

On the Fine-Grained Complexity of Parity Problems [article]

Amir Abboud, Shon Feller, Oren Weimann
2021 arXiv   pre-print
We consider the parity variants of basic problems studied in fine-grained complexity.  ...  A direct reduction from a problem to its parity version is often difficult to design.  ...  For NWT, this (conditionally) separates the counting and parity versions from the decision and approximate counting versions. Other Classes.  ... 
arXiv:2002.07415v3 fatcat:aswuhba4urd7fd5yh6vjtusfya

Reducing the burden of parallel loop schedulers for many‐core processors

Mahwish Arif, Hans Vandierendonck
2021 Concurrency and Computation  
These fine-grain loops perform operations such as reductions, filtering, and packing of array elements.  ...  To illustrate the problem, Figure 1 shows the duration of fine-grain parallel loops that occur in the Ligra 4 framework when calculating betweenness-centrality.  ...  Other fine-grain loops are launched from sequential code and involve all threads.  ... 
doi:10.1002/cpe.6241 fatcat:4rluruunxjb4dehant4kjl354e

Towards a self-reconfigurable embedded processor architecture

Shady O. Agwa, Hany H. Ahmad, Awad I. Saleh
2009 2009 International Conference on Computer Engineering & Systems  
As proof of concept, in this paper we show that a significant execution time reduction of approximately 42.5% and a 37% reduction in executed instruction count are achievable for the "RGB to CMYK Conversion  ...  The main technique employed to accelerate instruction execution in such processors is to add fixed hardware units, which may be useless for some applications yet insufficient for others.  ...  Coarse Grained Profiling vs. Fine Grained Profiling: Fine grained profiling means that every instruction is monitored to measure its execution weight.  ... 
doi:10.1109/icces.2009.5383316 fatcat:ahtvkwnra5fsvepeu2jnl65pgi

On the Fine-Grained Complexity of Parity Problems

Amir Abboud, Shon Feller, Oren Weimann, Emanuela Merelli, Anuj Dawar, Artur Czumaj
2020 International Colloquium on Automata, Languages and Programming  
We consider the parity variants of basic problems studied in fine-grained complexity.  ...  A direct reduction from a problem to its parity version is often difficult to design.  ...  For NWT, this (conditionally) separates the counting and parity versions from the decision and approximate counting versions. Table 2 The other (non-APSP) problems.  ... 
doi:10.4230/lipics.icalp.2020.5 dblp:conf/icalp/AbboudFW20 fatcat:yrvcpo4u6jhfviyu7q2aurhupe

Leveraging Patient Similarity and Time Series Data in Healthcare Predictive Models [article]

Mohammad Amin Morid, Olivia R. Liu Sheng, Samir Abdelrahman
2017 arXiv   pre-print
We select a piecewise aggregation approximation method to extract fine-grain temporal features and propose a minimalist method to impute missing values in temporal features.  ...  This study makes contributions to time series classification and early ICU mortality prediction via identifying and enhancing temporal feature engineering and reduction methods for similarity-based time  ...  PAA grain decision The optimal PAA grain decision is analytically intractable due to the apparent complexity of considering the interrelated factors including missing value imputation, feature reduction  ... 
arXiv:1704.07498v3 fatcat:ajtt5rcp6zbtnhpiuyi7znovc4

Profile guided selection of ARM and thumb instructions

Arvind Krishnaswamy, Rajiv Gupta
2002 SIGPLAN notices  
We propose profile guided algorithms for generating mixed ARM and Thumb code for application programs so that the resulting code gives significant code size reductions without loss in performance.  ...  However, the limitations of the Thumb instruction set, in comparison to the ARM instruction set, can often lead to generation of poorer quality code.  ...  ACKNOWLEDGEMENTS This work is supported by DARPA award F29601-00-1-0183 and National Science Foundation grants CCR-0208756, CCR-0105535, CCR-0096122, and EIA-9806525 to the University of Arizona.  ... 
doi:10.1145/566225.513840 fatcat:gf2rvwea3ze75fvamkrrmlzv3m

Profile guided selection of ARM and thumb instructions

Arvind Krishnaswamy, Rajiv Gupta
2002 Proceedings of the joint conference on Languages, compilers and tools for embedded systems software and compilers for embedded systems - LCTES/SCOPES '02  
We propose profile guided algorithms for generating mixed ARM and Thumb code for application programs so that the resulting code gives significant code size reductions without loss in performance.  ...  However, the limitations of the Thumb instruction set, in comparison to the ARM instruction set, can often lead to generation of poorer quality code.  ...  ACKNOWLEDGEMENTS This work is supported by DARPA award F29601-00-1-0183 and National Science Foundation grants CCR-0208756, CCR-0105535, CCR-0096122, and EIA-9806525 to the University of Arizona.  ... 
doi:10.1145/513829.513840 dblp:conf/lctrts/KrishnaswamyG02 fatcat:xjoq7g6km5byhbfvbntdouyym4

Profile guided selection of ARM and thumb instructions

Arvind Krishnaswamy, Rajiv Gupta
2002 Proceedings of the joint conference on Languages, compilers and tools for embedded systems software and compilers for embedded systems - LCTES/SCOPES '02  
We propose profile guided algorithms for generating mixed ARM and Thumb code for application programs so that the resulting code gives significant code size reductions without loss in performance.  ...  However, the limitations of the Thumb instruction set, in comparison to the ARM instruction set, can often lead to generation of poorer quality code.  ...  ACKNOWLEDGEMENTS This work is supported by DARPA award F29601-00-1-0183 and National Science Foundation grants CCR-0208756, CCR-0105535, CCR-0096122, and EIA-9806525 to the University of Arizona.  ... 
doi:10.1145/513837.513840 fatcat:ytaum7mmxnamfbktwphntx44qq

SoftWear: Software-Only In-Memory Wear-Leveling for Non-Volatile Main Memory [article]

Christian Hakert, Kuan-Hsun Chen, Paul R. Genssler, Georg von der Brüggen, Lars Bauer, Hussam Amrouch, Jian-Jia Chen, Jörg Henkel
2020 arXiv   pre-print
Specifically, we exploit the memory management unit (MMU), performance counters, and interrupts to approximate the memory write counts as an aging indicator.  ...  Hence, we further propose a fine-grained wear-leveling in the stack region of C / C++ compiled software.  ...  Furthermore, the statistical write-count approximation has to aggregate the captured write accesses from the shadow stack and from the real stack to the same physical page.  ... 
arXiv:2004.03244v2 fatcat:feg5ndpsorhmbnuz4ewnuupgva

Hardness of Bounded Distance Decoding on Lattices in ℓ_p Norms [article]

Huck Bennett, Chris Peikert
2020 arXiv   pre-print
We also show fine-grained hardness for _p,α.  ...  ≈ 4.2773, and give the very first fine-grained hardness for (in any norm).  ...  We thank Noah Stephens-Davidowitz for sharing his plot-generating code from [AS18a] with us.  ... 
arXiv:2003.07903v1 fatcat:3kmn7e5r6zez3mb55bw5exovu4

The Effects of Hot Deformation Parameters on the Size of Dynamically Recrystallised Austenite Grains of HSLA Steel

Sebastian Gnapowski, Marek Opiela, Elżbieta Kalinowska-Ozgowicz, Joanna Szulżyk-Cieplak
2020 Advances in Science and Technology Research Journal  
There are several ways to improve the internal structure of metals, such as the ultrasound used to solidify liquid metal.  ...  The homogeneity of the grains and the uniformity of the metal structure affects its mechanical strength.  ...  The reduction in a strain temperature from 1200 to 1100 °C at an austenitizing temperature of 1200 °C and strain rate of 1.0 s -1 allowed the γ grain size to be reduced from approx. 16 μm to approx. 10  ... 
doi:10.12913/22998624/118255 fatcat:mhux4foxaneg5h2ij7kfizy36e

Heterogeneous microarchitectures trump voltage scaling for low-power cores

Andrew Lukefahr, Shruti Padmanabha, Reetuparna Das, Ronald Dreslinski, Thomas F. Wenisch, Scott Mahlke
2014 Proceedings of the 23rd international conference on Parallel architectures and compilation - PACT '14  
We leverage PaTH to study the potential energy efficiency of fine-grained DVFS and HMs, as well as a hybrid approach.  ...  The question remains, in this fine-grained switching regime, which form of heterogeneity offers better energy efficiency for a given level of performance?  ...  The authors would like to thank the fellow members of the CCCP research group, our shepherd (Osman Unsal), and the anonymous reviewers for their time, suggestions, and valuable feedback.  ... 
doi:10.1145/2628071.2628078 dblp:conf/IEEEpact/LukefahrPDDWM14 fatcat:z4k6w56l75bsngfhhisfg23lfq

Grain size, composition, porosity and permeability contrasts within cross-bedded sandstones in Tertiary fluvial deposits, central Spain

CHRISTEL A. HARTKAMP, JOSE ARRIBAS, AMPARO TORTOSA
1993 Sedimentology  
In the cross-beds the average grain size ranges from medium grained sand in the eFL to flne grained s<llld in the FFL and BL.  ...  In all three subt�lcies. the average size of the primary pores is approximately I i/J unit smaller than the a verage grain size.  ...  In some samples, bottomsets display well developed, fine and coarse grained laminae; in these samples point counting was done parallel to the depositional surface in order to count coarse and fine grained  ... 
doi:10.1111/j.1365-3091.1993.tb01360.x fatcat:7ewkpho2gzhclii5jefmp7pknq

Trading Off Granularity against Complexity in Predictive Models for Complex Domains [chapter]

Ingrid Zukerman, David W. Albrecht, Ann E. Nicholson, Krystyna Doktor
2000 Lecture Notes in Computer Science  
Our results indicate that complex, coarse-grained models offer performance and computational advantages compared to simpler, fine-grained models. during the performance of a quest: average prediction 8  ...  We compare the performance and computational requirements of fine-grained models built with precise variable values with the performance and requirements of a coarsegrained model built with abstracted  ...  This points to the need to investigate a dynamic model selection policy, which can change from a coarse-grained model to a fine-grained model at some point during task performance.  ... 
doi:10.1007/3-540-44533-1_27 fatcat:kdednn227fh3bn4mj3rrj27xea
« Previous Showing results 1 — 15 out of 28,473 results