Stem flip$ (all stems)

52 papers:

DAC-2015-SeyedzadehMJM #encoding #memory management #named #pseudo #reduction

PRES: pseudo-random encoding scheme to increase the bit flip reduction in the memory (SMS, RM, AKJ, RGM), p. 6.

DATE-2015-TaatizadehN #automation #design #detection #embedded #validation

A methodology for automated design of embedded bit-flips detectors in post-silicon validation (PT, NN), pp. 73–78.

ICALP-v2-2015-GoldwasserKP #adaptation #revisited

Adaptively Secure Coin-Flipping, Revisited (SG, YTK, SP), pp. 663–674.

HCI-IT-2015-HakodaKSST #bound #gesture #mobile #named #using

AirFlip: A Double Crossing In-Air Gesture Using Boundary Surfaces of Hover Zone for Mobile Devices (HH, TK, KS, BS, JT), pp. 44–53.

LCT-2015-TriantafyllouT #student

Out of Classroom Instruction in the Flipped Classroom: The Tough Task of Engaging the Students (ET, OT), pp. 714–723.

ECIR-2015-ChongDL #modelling #predict #topic #using

Prediction of Venues in Foursquare Using Flipped Topic Models (WHC, BTD, EPL), pp. 623–634.

HPCA-2015-MaddahSM #named #optimisation #symmetry

CAFO: Cost aware flip optimization for asymmetric memories (RM, SMS, RGM), pp. 320–330.

DATE-2014-ImhofW #architecture #fault tolerance

Bit-Flipping Scan — A unified architecture for fault tolerance and offline test (MEI, HJW), pp. 1–6.

DATE-2014-LinZH #low cost

A low-cost radiation hardened flip-flop (YL, MZ, BH), pp. 1–6.

DATE-2014-NejatAA #power management #process

Dynamic Flip-Flop conversion to tolerate process variation in low power circuits (MN, BA, AAK), pp. 1–4.

CSEET-2014-KiatK #experience

The flipped classroom experience (PNK, YTK), pp. 39–43.

STOC-2014-BermanHT #bias #constant

Coin flipping of any constant bias implies one-way functions (IB, IH, AT), pp. 398–407.

STOC-2014-HaitnerT #protocol

An almost-optimally fair three-party coin-flipping protocol (IH, ET), pp. 408–416.

LCT-TRE-2014-Bharali #learning #online #process

Enhancing Online Learning Activities for Groups in Flipped Classrooms (RB), pp. 269–276.

KEOD-2014-KarkalasS #concept #learning #modelling #student

Intelligent Student Support in the FLIP Learning System based on Student Initial Misconceptions and Student Modelling (SK, SGS), pp. 353–360.

DATE-2013-Feng #geometry #grid #power management #reduction #scalability

Large-scale flip-chip power grid reduction with geometric templates (ZF), pp. 1679–1682.

DATE-2013-LuL #multi

Slack budgeting and slack to length converting for multi-bit flip-flop merging (CCL, RBL), pp. 1837–1842.

DATE-2013-SarrazinENBG #concurrent #design #detection #fault #performance

Scan design with shadow flip-flops for low performance overhead and concurrent delay fault detection (SS, SE, LAdBN, YB, VG), pp. 1077–1082.

CHI-2013-SzafirM #adaptation #bibliography #learning #named

ARTFul: adaptive review technology for flipped learning (DS, BM), pp. 1001–1010.

DAC-2012-LeeLHCCLS #design

Obstacle-avoiding free-assignment routing for flip-chip designs (PWL, HCL, YKH, YWC, CFC, IJL, CFS), pp. 1088–1093.

DATE-2012-HsuCCLC #effectiveness #on the #pseudo

On effective flip-chip routing via pseudo single redistribution layer (HWH, MLC, HMC, HCL, SHC), pp. 1597–1602.

DATE-2012-LiuLC #optimisation

Agglomerative-based flip-flop merging with signal wirelength optimization (SYL, CJL, HMC), pp. 1391–1396.

DATE-2011-ChenY #design

Timing-constrained I/O buffer placement for flip-chip designs (ZWC, JTY), pp. 619–624.

VLDB-2012-BarskyKWH11 #correlation #dataset #mining #scalability #taxonomy

Mining Flipping Correlations from Large Datasets with Taxonomies (MB, SK, TW, JH), pp. 370–381.

CHI-2011-RuizL #gesture #interactive #mobile #named

DoubleFlip: a motion gesture delimiter for mobile interaction (JR, YL), pp. 2717–2720.

DAC-2010-LiuZYCSZ #design

Global routing and track assignment for flip-chip designs (XL, YZ, GKY, CC, JS, XZ), pp. 90–93.

ICPR-2010-GuoC #invariant #named

FIND: A Neat Flip Invariant Descriptor (XG, XC), pp. 515–518.

ICPR-2010-ZhangGC #detection #invariant #using

Water Reflection Detection Using a Flip Invariant Shape Detector (HZ, XG, XC), pp. 633–636.

DAC-2009-FangWC #co-evolution #design

Flip-chip routing with unified area-I/O pad assignments for package-board co-design (JWF, MDFW, YWC), pp. 336–339.

SAT-2009-Szeider #complexity #satisfiability

The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (SS), pp. 276–283.

DAC-2008-KurimotoSAYOTS #detection #fault #optimisation #scalability

Phase-adjustable error detection flip-flops with 2-stage hold driven optimization and slack based grouping scheme for dynamic voltage scaling (MK, HS, RA, TY, HO, HT, HS), pp. 884–889.

SPLC-2008-AlvesCNMSB #aspect-oriented #named #product line

FLiP: Managing Software Product Line Extraction and Reaction with Aspects (VA, FC, VN, AM, SS, PB), p. 354.

DAC-2007-FangHC #algorithm #design #integer #linear #programming

An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design (JWF, CHH, YWC), pp. 606–611.

DAC-2007-SeomunKS

Skewed Flip-Flop Transformation for Minimizing Leakage in Sequential Circuits (JS, JK, YS), pp. 103–106.

DATE-2007-XuRC #analysis #interactive #pipes and filters #power management

Interactive presentation: Analysis of power consumption and BER of flip-flop based interconnect pipelining (JX, AR, MHC), pp. 1218–1223.

LATA-2007-BodiniFR

A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane (OB, TF, ER), pp. 139–150.

DAC-2006-ShamYC

Optimal cell flipping in placement and floorplanning (CWS, EFYY, CCNC), pp. 1109–1114.

DLT-2003-HolzerK03a #automaton #nondeterminism

Flip-Pushdown Automata: Nondeterminism Is Better than Determinism (MH, MK), pp. 361–372.

ICALP-2003-HolzerK #automaton

Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k (MH, MK), pp. 490–501.

DATE-2002-LuZKC

Flip-Flop and Repeater Insertion for Early Interconnect Planning (RL, GZ, CKK, KYC), pp. 690–695.

STOC-2001-Ambainis #bound #protocol #quantum

A new protocol and lower bounds for quantum coin flipping (AA), pp. 134–142.

ICALP-2001-Dodis #random

New Imperfect Random Source with Applications to Coin-Flipping (YD), pp. 297–309.

ICDAR-1999-ArikiMT #detection

Telop and Flip Frame Detection and Character Extraction from TV News Articles (YA, KM, ST), pp. 701–704.

STOC-1999-RussellSZ #bound

Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model (AR, MES, DZ), pp. 339–347.

DATE-1998-CornoPRV

Exploiting Symbolic Techniques for Partial Scan Flip Flop Selection (FC, PP, MSR, MV), pp. 670–677.

STOC-1997-Aspnes #bound #distributed #random

Lower Bounds for Distributed Coin-Flipping and Randomized Consensus (JA), pp. 559–568.

HCI-SEC-1997-HolmquistA #approach #scalability #set #visualisation

Flip Zooming: A Practical Focus+Context Approach to Visualizing Large Data Sets (LEH, CA), pp. 763–766.

STOC-1996-NewmanS #communication #game studies

Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract) (IN, MS), pp. 561–570.

DAC-1994-ChakradharBA #algorithm

An Exact Algorithm for Selecting Partial Scan Flip-Flops (STC, AB, VDA), pp. 81–86.

SOSP-WIP-1991-KasshoekRST92 #distributed #protocol

FLIP; an Internetwork Protocol for Supporting Distributed Systems (Abstract) (MFK, RvR, HvS, AST), p. 29.

STOC-1986-Cleve #security

Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract) (RC), pp. 364–369.

DAC-1978-Evans #simulation

Accurate simulation of flip-flop timing characteristics (DJE), pp. 398–404.