Stem flat$ (all stems)

58 papers:

STOC-2015-MulzerNSS #approximate #nearest neighbour

Approximate k-flat Nearest Neighbor Search (WM, HLN, PS, YS), pp. 783–792.

CHI-2015-KawaguchiKS #case study #image

Study on Gaze Direction Perception of Face Image Displayed on Rotatable Flat Display (IK, HK, YS), pp. 1729–1737.

DUXU-DD-2015-WuLLL #design #experience #interface #morphism #navigation

Skeuomorphism and Flat Design: Evaluating Users’ Emotion Experience in Car Navigation Interface Design (LW, TL, JL, BL), pp. 567–575.

TACAS-2014-AlbertiGS #array

Decision Procedures for Flat Array Properties (FA, SG, NS), pp. 15–30.

CHI-2014-PanSS #interactive #trust

Comparing flat and spherical displays in a trust scenario in avatar-mediated interaction (YP, WS, AS), pp. 1397–1406.

ICPR-2014-KimP14a #3d #interactive #physics #using

Sensor-Display Registration for 3D Physical User Interaction Using a Flat-Panel Display (JSK, JMP), pp. 1675–1680.

HPCA-2014-ZhangBES #design #named #protocol #scalability #verification

PVCoherence: Designing flat coherence protocols for scalable verification (MZ, JDB, JE, DJS), pp. 392–403.

SMT-2014-AlbertiGS #array

Decision Procedures for Flat Array Properties (FA, SG, NS), p. 51.

VMCAI-2014-BozgaIK #integer #problem #safety #source code

Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops (MB, RI, FK), pp. 242–261.

ICALP-v2-2013-DemriDS #complexity #on the #verification

On the Complexity of Verifying Regular Properties on Flat Counter Systems, (SD, AKD, AS), pp. 162–173.

KEOD-2013-ChulyadyoHB #approach #automation #ontology

Core Ontology based Approach for Treating the Flatness of Automatically Built Ontology (RC, MH, GB), pp. 316–323.

SIGIR-2013-TureL #information retrieval #modelling

Flat vs. hierarchical phrase-based translation models for cross-language information retrieval (FT, JJL), pp. 813–816.

CSCW-2012-BoltonKV #comparison #performance #using

A comparison of competitive and cooperative task performance using spherical and flat displays (JB, KK, RV), pp. 529–538.

PPDP-2012-MonjarazM #haskell #π-calculus

From the π-calculus to flat GHC (RM, JM), pp. 163–172.

OSDI-2012-NightingaleEFHHS

Flat Datacenter Storage (EBN, JE, JF, OSH, JH, YS), pp. 1–15.

ICLP-J-2012-BliemMW #declarative #named #problem #programming #using

D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (BB, MM, SW), pp. 445–464.

IJCAR-2012-DemriDS #ltl

Taming Past LTL and Flat Counter Systems (SD, AKD, AS), pp. 179–193.

FoSSaCS-2011-JaubertR #analysis #automaton #robust

Quantitative Robustness Analysis of Flat Timed Automata (RJ, PAR), pp. 229–244.

CHI-2011-FindlaterWW #type system

Typing on flat glass: examining ten-finger expert typing patterns on touch surfaces (LF, JOW, DW), pp. 2453–2462.

CSCW-2011-BoltonKV #privacy #scalability

Privacy and sharing information on spherical and large flat displays (JB, KK, RV), pp. 573–574.

CIKM-2011-ShanZHYYL #performance #query

Efficient phrase querying with flat position index (DS, WXZ, JH, RY, HY, XL), pp. 2001–2004.

CASE-2010-ShahiniMY

Characterization of micro forces in pushing flat micro-sized objects (MS, WWM, JTWY), pp. 539–544.

ICPR-2010-Meyer

Levelings and Flat Zone Morphology (FM), pp. 1570–1573.

SEKE-2010-AbuzeidHT #algorithm #performance #reduction #testing

FLAT A Fast Lattice-Based Algorithm for Test Suite Reduction (ARA, HSH, IAHT), p. 67.

ICSE-2010-SavageRP #feature model #named

FLAT³: feature location and textual tracing tool (TS, MR, DP), pp. 255–258.

RTA-2009-SeidlV #protocol

Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case (HS, KNV), pp. 118–132.

CSEET-2007-PortN #education #named #re-engineering

Panel: Software Engineering Education for a Flat World (DP, RN), p. 361.

RTA-2007-GodoyHT #termination

Termination of Rewriting with Right-Flat Rules (GG, EH, AT), pp. 200–213.

VMCAI-2007-BozgaI #on the #source code

On Flat Programs with Lists (MB, RI), pp. 122–136.

ICALP-v1-2006-DaskalakisFP #complexity #game studies #nash

The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (CD, AF, CHP), pp. 513–524.

ICALP-v2-2006-BozgaIL #automaton #parametricity

Flat Parametric Counter Automata (MB, RI, YL), pp. 577–588.

DATE-DF-2004-DaglioIRRS #component #performance #simulation

Building the Hierarchy from a Flat Netlist for a Fast and Accurate Post-Layout Simulation with Parasitic Components (PD, DI, DR, CR, SS), pp. 336–337.

CHI-2004-BaudischPB #usability #user interface

Flat volume control: improving usability by hiding the volume control hierarchy in the user interface (PB, JP, SB), pp. 255–262.

ICPR-v1-2004-YamashitaKKM #documentation #image #re-engineering

Shape Reconstruction and Image Restoration for Non-Flat Surfaces of Documents with a Stereo Vision System (AY, AK, TK, KTM), pp. 482–485.

RE-2003-Yilmazturk #development #metric

RE in Flatness Measurement and Control Systems Development at ABB (NY), p. 293.

CSL-2000-ComonC

Flatness Is Not a Weakness (HC, VC), pp. 262–276.

KDD-1999-DuMouchelVJCP

Squashing Flat Files Flatter (WD, CV, TJ, CC, DP), pp. 6–15.

DATE-1998-KoehlBLKP #design

A Flat, Timing-Driven Design System for a High-Performance CMOS Processor Chipset (JK, UB, TL, BK, TP), pp. 312–320.

ICPR-1998-LamIL #algorithm #performance

Approaches to decompose flat structuring element for fast overlapping search morphological algorithm (RWKL, HHSI, CKL), pp. 1461–1463.

DAC-1997-Vygen #algorithm #scalability

Algorithms for Large-Scale Flat Placement (JV), pp. 746–751.

HCI-CC-1997-SaitoJVS #aspect-oriented

Ergonomic Aspects of Flat Panel Display and Large-Size CRT Screen (SS, HJ, MBGV, MS), pp. 639–642.

HPCA-1997-YangT #memory management #multi

Speeding up the Memory Hierarchy in Flat COMA Multiprocessors (LY, JT), pp. 4–13.

ICLP-1995-Hirata #correctness #haskell #proving #π-calculus

Proving Correctness of Translation from Moded Flat GHC to π-Calculus (KH), p. 818.

FPCA-1993-SastryCA #analysis #functional #strict

Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates (AVSS, WDC, ZMA), pp. 266–275.

HCI-ACS-1993-SaitoSTSS #eye tracking

Characteristics of Vertical Eye Movements in the Workstation Used Flat Panel Display (SS, MS, ST, TS, SS), pp. 756–761.

SAC-1993-KaraliPH #prolog

A Versatile Module System for Prolog Mapped to Flat Prolog (IK, EP, CH), pp. 578–585.

ICLP-1991-KorslootT #compilation #concurrent #logic programming #programming language

Compilation Techniques for Nondeterminate Flat Concurrent Logic Programming Languages (MK, ET), pp. 457–471.

CLP-1990-UedaM90 #haskell #implementation

A New Implementation Technique for Flat GHC (KU, MM), pp. 3–17.

PODS-1988-ParedaensG #algebra #using

Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions (JP, DVG), pp. 29–38.

JICSCP-1988-AlkalajS88 #architecture #concurrent #prolog

An Architectural Model for a Flat Concurrent Prolog Processor (LA, EYS), pp. 1277–1297.

JICSCP-1988-NilssonT88 #haskell #implementation

A Flat GHC Implementation for Supercomputers (MN, HT), pp. 1337–1350.

LICS-1988-Bloom #modelling #λ-calculus

Can LCF Be Topped? Flat Lattice models of Typed λ Calculus (Preliminary Report) (BB), pp. 282–295.

LICS-1988-GerthCLS #concurrent #prolog #semantics

Fully Abstract Denotational Semantics for Flat Concurrent Prolog (RG, MC, YL, EYS), pp. 320–335.

VLDB-1987-SchollPS #kernel #relational

Supporting Flat Relations by a Nested Relational Kernel (MHS, HBP, HJS), pp. 137–146.

ICLP-1987-ChikayamaK87 #haskell #multi

Multiple Reference Management in Flat GHC (TC, YK), pp. 276–293.

ICLP-1987-IchiyoshiMT87 #distributed #haskell #implementation #multi

A Distributed Implementation of Flat GHC on the Multi-PSI (MI, TM, KT), pp. 257–275.

SIGMOD-1986-DadamKABEGLPW #prototype

A DBMS Prototype to Support Extended NF2 Relations: An Integrated View on Flat Tables and Hierarchies (PD, KK, FA, HMB, RE, JG, VYL, PP, GW), pp. 356–367.

LFP-1982-GotoSIIIHSSP #design #lisp

Design of a Lisp Machine — FLATS (EG, TS, NI, TI, MI, KH, MS, KS, BP), pp. 208–215.