Stem perman$ (all stems)

32 papers:

CASE-2015-TomolaMBC #robust

Robust codiagnosability of discrete-event systems against permanent loss of observations (JHAT, MVM, JCB, LKC), pp. 813–818.

DATE-2015-BishnoiLGF #2d #named

d2-LBDR: distance-driven routing to handle permanent failures in 2D mesh NOCs (RB, VL, MSG, JF), pp. 800–805.

DUXU-IXD-2015-RibeiroM #case study #community #design #education #health

Origins and Perspectives on Designing Virtual Communities of Practice for Permanent Education: A Case Study in the Collective Health Sector (CER, CRM), pp. 94–103.

KDD-2014-00020GMB #community #network #on the

On the permanence of vertices in network communities (TC, SS, NG, AM, SB), pp. 1396–1405.

CASE-2013-ChaouiS13a #adaptation

Electrical sensorless adaptive control of permanent magnet synchronous machine drives (HC, PS), pp. 705–710.

DATE-2013-AlieeGRT #analysis #automation #fault #reliability

Automatic success tree-based reliability analysis for the consideration of transient and permanent faults (HA, MG, FR, JT), pp. 1621–1626.

DATE-2013-AnanthanarayananGP #detection #fault #low cost #set #using

Low cost permanent fault detection using ultra-reduced instruction set co-processors (SA, SG, HDP), pp. 933–938.

DATE-2013-CassanoCKHPS #configuration management #online #testing

On-line testing of permanent radiation effects in reconfigurable systems (LC, DC, SK, JH, MP, LS), pp. 717–720.

DATE-2013-RakossyHTSNO #architecture #array #fault #functional #testing

Hot-swapping architecture with back-biased testing for mitigation of permanent faults in functional unit array (ZER, MH, HT, TS, YN, HO), pp. 535–540.

DUXU-NTE-2013-WaldronS

Calculation of Areas of Permanence in Public Spaces, According to Solar Radiation Simulated Conditions (JAW, JHS), pp. 215–223.

ICALP-v1-2011-JansenS #constant #polynomial

Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (MJJ, RS), pp. 724–735.

AGTIVE-2011-MantzJT #concept #consistency #evolution #graph transformation #metamodelling #migration

Graph Transformation Concepts for Meta-model Evolution Guaranteeing Permanent Type Conformance throughout Model Migration (FM, SJ, GT), pp. 3–18.

DATE-2010-Scholzel #detection #fault #performance

HW/SW co-detection of transient and permanent faults with fast recovery in statically scheduled data paths (MS), pp. 723–728.

ICALP-v1-2010-DellHW #complexity #exponential #polynomial

Exponential Time Complexity of the Permanent and the Tutte Polynomial (HD, TH, MW), pp. 426–437.

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.

ICML-2008-SilverSM #learning

Sample-based learning and search with permanent and transient memories (DS, RSS, MM), pp. 968–975.

CASE-2007-PanH #analysis

Diagnosability Analysis and Sensor Selection in Discrete-Event Systems with Permanent Failures (JP, SHZ), pp. 869–874.

ASE-2006-Volanschi #approach

A Portable Compiler-Integrated Approach to Permanent Checking (ENV), pp. 103–112.

DATE-2005-SchianoOLPS #analysis #fault #on the #reliability

On the Analysis of Reed Solomon Coding for Resilience to Transient/Permanent Faults in Highly Reliable Memories (LS, MO, FL, SP, AS), pp. 580–585.

STOC-2004-Raz #multi

Multi-linear formulas for permanent and determinant are of super-polynomial size (RR), pp. 633–641.

STOC-2002-ChienRS #algebra #approximate

Clifford algebras and approximating the permanent (SC, LER, AS), pp. 222–231.

DATE-2001-RoussellePBMV #embedded #fault

A register-transfer-level fault simulator for permanent and transient faults in embedded processors (CR, MP, AB, TM, HTV), p. 811.

STOC-2001-JerrumSV #algorithm #approximate #matrix #polynomial

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries (MJ, AS, EV), pp. 712–721.

HT-2000-SimonsonBB #version control

Content permanence via versioning and fingerprinting (JS, DB, AB), pp. 226–227.

STOC-2000-Furer #approximate #matrix

Approximating permanents of complex matrices (MF), pp. 667–669.

STOC-1998-LinialSW #algorithm #approximate #matrix #polynomial #scalability

A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents (NL, AS, AW), pp. 644–652.

STOC-1997-McCuaigRST

Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract) (WM, NR, PDS, RT), pp. 402–405.

STOC-1992-FeigeL #matrix #on the #random

On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) (UF, CL), pp. 643–654.

STOC-1988-Broder #approximate #how #random

Errata to “How hard is to marry at random? (On the approximation of the permanent)” (AZB), p. 551.

STOC-1988-JerrumS #agile #approximate #markov

Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) (MJ, AS), pp. 235–244.

ICALP-1988-VaziraniY #graph

Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs (VVV, MY), pp. 667–681.

STOC-1986-Broder #approximate #how #random

How hard is to marry at random? (On the approximation of the permanent) (AZB), pp. 50–58.