Stem ani$ (all stems)

54 papers:

VMCAI-2015-ChristakisG #composition #image #memory management #parsing #proving #safety #testing #using

Proving Memory Safety of the ANI Windows Image Parser Using Compositional Exhaustive Testing (MC, PG), pp. 373–392.

STOC-2014-BermanHT #bias #constant

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

STOC-2014-ForbesSS #algebra #branch #multi #order #set #source code

Hitting sets for multilinear read-once algebraic branching programs, in any order (MAF, RS, AS), pp. 867–875.

ICALP-v1-2014-DemaineDFPSWW #assembly #simulation

One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile (EDD, MLD, SPF, MJP, RTS, AW, DW), pp. 368–379.

VISSOFT-2014-RufiangeM #evolution #named #visualisation

AniMatrix: A Matrix-Based Visualization of Software Evolution (SR, GM), pp. 137–146.

FSE-2014-Jorgensen #question #re-engineering #what

Ten years with evidence-based software engineering. What is it? Has it had any impact? What’s next? (MJ), p. 3.

CSMR-2013-MihanceaM #correlation #fault #morphism #polymorphism #question

Changes, Defects and Polymorphism: Is There Any Correlation? (PFM, CM), pp. 341–344.

CHI-2013-DevendorfR #interactive #named

AnyType: provoking reflection and exploration with aesthetic interaction (LD, KR), pp. 1041–1050.

DHM-HB-2013-ZhangZLDW #optimisation

Optimization for Lunar Mission Training Scheme Based on AnyBody Software (JZ, RZ, JL, LD, LW), pp. 169–178.

ICML-c3-2013-DekelH

Better Rates for Any Adversarial Deterministic MDP (OD, EH), pp. 675–683.

ICMT-2013-BaggeL

Walk Your Tree Any Way You Want (AHB, RL), pp. 33–49.

DATE-2012-YangLTW #modelling

Almost every wire is removable: A modeling and solution for removing any circuit wire (XY, TKL, WCT, YLW), pp. 1573–1578.

ICSM-2012-HoraADA #question

Domain specific warnings: Are they any better? (AH, NA, SD, SA), pp. 441–450.

ICALP-v1-2012-AmbainisBBKOSV #game studies #quantum

Quantum Strategies Are Better Than Classical in Almost Any XOR Game (AA, AB, KB, DK, RO, JS, MV), pp. 25–37.

CHI-2012-JunuzovicIBG #named

IllumiShare: sharing any surface (SJ, KI, TB, AG), pp. 1919–1928.

ECOOP-2012-LeeGHM #metaprogramming #named

Marco: Safe, Expressive Macros for Any Language (BL, RG, MH, KSM), pp. 589–613.

PASTE-2011-BernatM

Anywhere, any-time binary instrumentation (ARB, BPM), pp. 9–16.

STOC-2011-Karnin

Deterministic construction of a high dimensional lp section in l1n for any p<2 (ZSK), pp. 645–654.

STOC-2011-LinP

Constant-round non-malleable commitments from any one-way function (HL, RP), pp. 705–714.

HIMI-v2-2011-SakamotoNI #collaboration #multi #off the shelf

Dodging Window Interference to Freely Share Any Off-the-Shelf Application among Multiple Users in Co-located Collaboration (SS, MN, TI), pp. 305–314.

ICPR-2010-OliveiraL #education

Generalizing Tableau to Any Color of Teaching Boards (DMdO, RDL), pp. 2411–2414.

SIGIR-2010-ZucconAR #question

Has portfolio theory got any principles? (GZ, LA, KvR), pp. 755–756.

STOC-2008-CaiCL #bound #exclamation #polynomial #problem

A quadratic lower bound for the permanent and determinant problem over any characteristic != 2 (JyC, XC, DL), pp. 491–498.

ICALP-A-2008-HallgrenH #quantum

Superpolynomial Speedups Based on Almost Any Quantum Circuit (SH, AWH), pp. 782–795.

STOC-2007-HaitnerR #statistics

Statistically-hiding commitment from any one-way function (IH, OR), pp. 1–10.

LATA-2007-Domosi #automaton #network

Automata Networks without any Letichevsky Criteria (PD), pp. 237–248.

CSL-2007-FinkelL #rank

There Exist Some ω-Powers of Any Borel Rank (OF, DL), pp. 115–129.

HT-2006-MillardR #hypermedia #question #web

Web 2.0: hypertext by any other name? (DEM, MR), pp. 27–30.

KDD-2006-TaoXZ #database #metric #mining #scalability

Mining distance-based outliers from large databases in any metric space (YT, XX, SZ), pp. 394–403.

KR-2006-Straccia #logic programming #query #source code

Query Answering under the Any-World Assumption for Normal Logic Programs (US), pp. 329–339.

DAC-2005-VolkerinkM #architecture #using

Response compaction with any number of unknowns using a new LFSR architecture (EHV, SM), pp. 117–122.

ICALP-2005-KumarSS #algorithm #clustering #linear #problem

Linear Time Algorithms for Clustering Problems in Any Dimensions (AK, YS, SS), pp. 1374–1385.

ICALP-2005-MaurerS

Single-Key AIL-MACs from Any FIL-MAC (UMM, JS), pp. 472–484.

VLDB-2003-HulgeriS #cost analysis #named #optimisation #parametricity #query

AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions (AH, SS), pp. 766–777.

ASE-2002-CalderM #automation #communication #concurrent #process #verification

Automatic Verification of any Number of Concurrent, Communicating Processes (MC, AM), pp. 227–230.

ICPR-v4-2002-IshiyamaS #recognition

Geodesic Illumination Basis: Compensating for Illumination Variations in any Pose for Face Recognition (RI, SS), pp. 297–301.

KDD-2002-JoshiAK #predict #question

Predicting rare classes: can boosting make any weak learner strong? (MVJ, RCA, VK), pp. 297–306.

ICALP-2000-AielloBOR #performance #proving #verification

Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP (WA, SNB, RO, SR), pp. 463–474.

CSCW-2000-Sun #editing #undo

Undo any operation at any time in group editors (CS), pp. 191–200.

STOC-1999-CrescenzoI

Security-Preserving Hardness-Amplification for Any Regular One-Way Function (GDC, RI), pp. 169–178.

TOOLS-USA-1999-Ege #database #java

Storing Java Objects in Any Database (RKE), pp. 312–321.

STOC-1998-LewinV #polynomial #question #towards

Checking Polynomial Identities over any Field: Towards a Derandomization? (DL, SPV), pp. 438–447.

ICDAR-1997-NakagawaHYSHA #database #online #sequence

On-line Handwritten Character Pattern Database Sampled in a Sequence of Sentences without any Writing Instructions (MN, TH, YY, SiS, LH, KA), pp. 376–381.

ICDAR-1997-OgierMLL #analysis #image #reliability #semantics

An Image Interpretation Device cannot be Reliable without any Semantic Coherency Analysis of the Interpretated Objects — Application to French Cadastral Maps (JMO, RM, JL, YL), pp. 532–535.

STOC-1997-LoH #robust

All of Us are Smarter Than Any of Us: Wait-Free Hierarchies are not Robust (WKL, VH), pp. 579–588.

ICPR-1996-FischerN #algorithm #comprehension #image #parallel

A parallel any-time control algorithm for image understanding (VF, HN), pp. 141–145.

ICPR-1996-KaruJB #image #question

Is there any texture in the image? (KK, AKJ, RMB), pp. 770–774.

RTA-1995-ChenA #commutative #named

STORM: A MAny-to-One Associative-Commutative Matcher (TC, SA), pp. 414–419.

PODS-1994-SuciuP #algebra #algorithm #exponential #set #transitive

Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure (DS, JP), pp. 201–209.

RTA-1991-NarendranR #canonical #commutative #finite

Any Gound Associative-Commutative Theory Has a Finite Canonical System (PN, MR), pp. 423–434.

STOC-1989-PittW #approximate #automaton #consistency #polynomial #problem

The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial (LP, MKW), pp. 421–432.

STOC-1988-BellareM #how

How to Sign Given Any Trapdoor Function (Extended Abstract) (MB, SM), pp. 32–42.

STOC-1987-GoldreichMW #game studies #how #protocol #theorem

How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority (OG, SM, AW), pp. 218–229.

SIGMOD-1983-Stonebraker #question

DBMS and AI: Is There any Common Point of View? (MS), p. 134.