Stem node$ (all stems)

179 papers:

CASE-2015-ZhangTYL #assessment #markov #reliability #using

CAN node reliability assessment using segmented discrete time Markov chains (LZ, LT, FY, YL), pp. 231–236.

DAC-2015-ZhangLSLWXY #energy #migration #scheduling

Deadline-aware task scheduling for solar-powered nonvolatile sensor nodes with global energy migration (DZ, YL, XS, JL, TW, CJX, HY), p. 6.

DATE-2015-GoudVRR #design #robust #symmetry

Asymmetric underlapped FinFET based robust SRAM design at 7nm node (AAG, RV, AR, KR), pp. 659–664.

DATE-2015-LiLZGSSZCLY #energy #performance

An energy efficient backup scheme with low inrush current for nonvolatile SRAM in energy harvesting sensor nodes (HL, YL, QZ, YG, XS, GS, CZ, MFC, RL, HY), pp. 7–12.

DATE-2015-YuSHEAB #library #multi #statistics #using

Statistical library characterization using belief propagation across multiple technology nodes (LY, SS, CH, IME, DAA, DSB), pp. 1383–1388.

PODS-2015-PraveenS #graph #how #question

Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? (MP, BS), pp. 159–172.

VLDB-2015-LoghinTZOT #big data #performance

A Performance Study of Big Data on Small Nodes (DL, BMT, HZ, BCO, YMT), pp. 762–773.

ICML-2015-TangSX #learning #network

Learning Scale-Free Networks by Dynamic Node Specific Degree Prior (QT, SS, JX), pp. 2247–2255.

OOPSLA-2015-MadsenTL #javascript #static analysis

Static analysis of event-driven Node.js JavaScript applications (MM, FT, OL), pp. 505–519.

SAC-2015-BohdanowiczFFMN #locality

RSSI-based localization of a wireless sensor node with a flying robot (FB, HF, RF, DM, FN, IS), pp. 708–715.

DATE-2014-BraojosDBAA #approach #hardware #manycore #power management

Hardware/software approach for code synchronization in low-power multi-core sensor nodes (RB, AYD, IB, GA, DA), pp. 1–6.

DATE-2014-CasamassimaFB #network #power management

Context aware power management for motion-sensing body area network nodes (FC, EF, LB), pp. 1–6.

STOC-2014-EneV #algorithm #approximate #bound #design #network #problem #requirements

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements (AE, AV), pp. 754–763.

STOC-2014-KrishnaswamyNPS #approximate #clustering #design #energy #network #performance

Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing (RK, VN, KP, CS), pp. 734–743.

CHI-2014-AlperRH #case study #diagrams #visual notation

Structuring the space: a study on enriching node-link diagrams with visual references (BA, NHR, TH), pp. 1825–1834.

ICEIS-v1-2014-CoelhoAABB #network #using

Router Nodes Positioning for Wireless Networks Using Artificial Immune Systems (PHGC, JLMdA, JFMdA, LFdAB, AVdB), pp. 415–421.

ICML-c2-2014-AziziAG #composition #learning #network

Learning Modular Structures from Network Data and Node Variables (EA, EA, JEG), pp. 1440–1448.

ICML-c2-2014-WuCLY #behaviour #consistency #learning #network #predict #social

Learning the Consistent Behavior of Common Users for Target Node Prediction across Social Networks (SHW, HHC, KHL, PSY), pp. 298–306.

MLDM-2014-BaroutiKKM #clustering #data type #distributed #monitoring

Monitoring Distributed Data Streams through Node Clustering (MB, DK, JK, YM), pp. 149–162.

SIGIR-2014-WangWLC #perspective #re-engineering

Influential nodes selection: a data reconstruction perspective (ZW, HW, QL, EC), pp. 879–882.

SAC-2014-ArnaboldiCGPP #information management

Information diffusion in OSNs: the impact of nodes’ sociality (VA, MC, MLG, AP, FP), pp. 616–621.

SAC-2014-DouglasL #database #embedded #named #sql

LittleD: a SQL database for sensor nodes and embedded applications (GD, RL), pp. 827–832.

HPDC-2014-RazaviIK #as a service #image #named #virtual machine

Squirrel: scatter hoarding VM image contents on IaaS compute nodes (KR, AI, TK), pp. 265–278.

DAC-2013-MallikZLCBBBCRBMV #analysis #evaluation #framework #named

TEASE: a systematic analysis framework for early evaluation of FinFET-based advanced technology nodes (AM, PZ, TTL, BC, BB, PRDB, RB, KC, JR, MB, AM, DV), p. 6.

DATE-2013-HamdiouiNGGGB #challenge #realtime #reliability

Reliability challenges of real-time systems in forthcoming technology nodes (SH, MN, DG, AG, GG, PB), pp. 129–134.

DATE-2013-HsiehWH #configuration management #distributed #named #network

DANCE: distributed application-aware node configuration engine in shared reconfigurable sensor networks (CMH, ZW, JH), pp. 839–842.

DATE-2013-KappelHHHHH #concept #energy #power management #self

Alternative power supply concepts for self-sufficient wireless sensor nodes by energy harvesting (RK, GH, GH, TH, GH, GH), p. 481.

DATE-2013-KazmierskiWAM #energy #optimisation #performance

DoE-based performance optimization of energy management in sensor nodes powered by tunable energy-harvesters (TJK, LW, BMAH, GVM), p. 484.

DATE-2013-ZhouZY #design #energy #memory management #network #using

The design of sustainable wireless sensor network node using solar energy and phase change memory (PZ, YZ, JY), pp. 869–872.

HT-2013-JarukasemratanaML #algorithm #community #detection #distance #network

Community detection algorithm based on centrality and node distance in scale-free networks (SJ, TM, XL), pp. 258–262.

SIGMOD-2013-ChenZ #difference #privacy #recursion #strict #towards

Recursive mechanism: towards node differential privacy and unrestricted joins (SC, SZ), pp. 653–664.

SIGMOD-2013-TruongBDS #named #xml

MESSIAH: missing element-conscious SLCA nodes search in XML data (BQT, SSB, CED, AS), pp. 37–48.

VLDB-2014-QiXSW13 #distance #graph #towards

Toward a Distance Oracle for Billion-Node Graphs (ZQ, YX, BS, HW), pp. 61–72.

VLDB-2014-YuLZCP13 #effectiveness

More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks (WY, XL, WZ, LC, JP), pp. 13–24.

STOC-2013-LeeMM #theorem

A node-capacitated okamura-seymour theorem (JRL, MM, MM), pp. 495–504.

ICALP-v1-2013-BateniHL #algorithm #approximate #problem

Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems (MB, MH, VL), pp. 81–92.

VISSOFT-2013-AbuthawabehBZD #matrix #multi #visualisation

Finding structures in multi-type code couplings with node-link and matrix visualizations (AA, FB, DZ, SD), pp. 1–10.

ICEIS-v1-2013-CoelhoAABB #industrial #network

Deploying Nodes for Industrial Wireless Networks by Artificial Immune Systems Techniques (PHGC, JLMdA, JFMdA, LFdAB, AVdB), pp. 536–540.

GPCE-2013-0001RN #abstract syntax tree #declarative #fine-grained #mining #source code

Declarative visitors to ease fine-grained source code mining with full history on billions of AST nodes (RD, HR, TNN), pp. 23–32.

SAC-2013-AhmedE #network #trust

Discovering influential nodes from trust network (SA, CIE), pp. 121–128.

SAC-2013-FlushingC #network #optimisation

A flow-based optimization model for throughput-oriented relay node placement in wireless sensor networks (EFF, GADC), pp. 632–639.

DAC-2012-ChristmannBCWP #energy #power management

Energy harvesting and power management for autonomous sensor nodes (JFC, EB, CC, JW, CP), pp. 1049–1054.

DAC-2012-LeeKYBS #design #guidelines #power management

Circuit and system design guidelines for ultra-low power sensor nodes (YL, YK, DY, DB, DS), pp. 1037–1042.

DAC-2012-ParkKCDCP #prototype

Approaching the theoretical limits of a mesh NoC with a 16-node chip prototype in 45nm SOI (SP, TK, CHOC, BKD, AC, LSP), pp. 398–405.

DATE-2012-ShoaibJV

Enabling advanced inference on sensor nodes through direct use of compressively-sensed signals (MS, NKJ, NV), pp. 437–442.

DATE-2012-WalravensD #architecture #design #energy

Design of a low-energy data processing architecture for WSN nodes (CW, WD), pp. 570–573.

DATE-2012-WangKAAW #design #energy #optimisation

Response-surface-based design space exploration and optimisation of wireless sensor nodes with tunable energy harvesters (LW, TJK, BMAH, MA, JW), pp. 733–738.

VLDB-2012-SunWWSL #graph #performance

Efficient Subgraph Matching on Billion Node Graphs (ZS, HW, HW, BS, JL), pp. 788–799.

STOC-2012-Chuzhoy #on the

On vertex sparsifiers with Steiner nodes (JC), pp. 673–688.

ICALP-v1-2012-ChekuriEV #design #graph #network #product line

Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs (CC, AE, AV), pp. 206–217.

ICEIS-v1-2012-CoelhoAA #industrial #network

Node Positioning — Application for Wireless Networks Industrial Plants (PHGC, JLMdA, JFMdA), pp. 291–294.

CIKM-2012-BodenGS #clustering #evolution #graph

Tracing clusters in evolving graphs with node attributes (BB, SG, TS), pp. 2331–2334.

CIKM-2012-LeePKL #graph #named #novel #ranking #recommendation

PathRank: a novel node ranking measure on a heterogeneous graph for recommender systems (SL, SP, MK, SgL), pp. 1637–1641.

ICPR-2012-BurgessKA #locality #network

Node localization in unsynchronized time of arrival sensor networks (SB, YK, KÅ), pp. 2042–2046.

ICPR-2012-DahmBCG #detection #morphism

Topological features and iterative node elimination for speeding up subgraph isomorphism detection (ND, HB, TC, YG), pp. 1164–1167.

PADL-2012-BromanN #equation #modelling #object-oriented #semantics

Node-Based Connection Semantics for Equation-Based Object-Oriented Modeling Languages (DB, HN), pp. 258–272.

SAC-2012-SakkopoulosPSTPS #deployment #distributed #framework #named

DREAM: a distributed fRamework for customized dEployment of a vAriety of indexing engines over million-node overlays (ES, AP, SS, DT, GP, AS), pp. 853–858.

HPDC-2012-DinuN #comprehension

Understanding the effects and implications of compute node related failures in hadoop (FD, TSEN), pp. 187–198.

ICTSS-2012-HiromoriUYH #evaluation #performance #protocol #testing

Protocol Testing and Performance Evaluation for MANETs with Non-uniform Node Density Distribution (AH, TU, HY, TH), pp. 231–246.

CASE-2011-LeeLNCC #design #optimisation

Design optimization of one-time-use leaping mechanism for sensor node relocation (GL, GL, YN, NYC, DC), pp. 749–754.

DAC-2011-DeOrioABP #architecture #distributed #manycore #named

DRAIN: distributed recovery architecture for inaccessible nodes in multi-core chips (AD, KA, VB, LSP), pp. 912–917.

DAC-2011-GhaniN #branch #grid #power management #using #verification

Power grid verification using node and branch dominance (NHAG, FNN), pp. 682–687.

DAC-2011-Warnock #challenge #design

Circuit design challenges at the 14nm technology node (JDW), pp. 464–467.

DATE-2011-GoyalN #grid #performance #power management #using #verification

Efficient RC power grid verification using node elimination (AG, FNN), pp. 257–260.

DATE-2011-WeddellMA #power management

Ultra low-power photovoltaic MPPT technique for indoor and outdoor wireless sensor nodes (ASW, GVM, BMAH), pp. 905–908.

HT-2011-Pisarski #hypermedia #towards

New plots for hypertext?: towards poetics of a hypertext node (MP), pp. 313–318.

SIGMOD-2011-Quiane-RuizPSD #pipes and filters

RAFT at work: speeding-up mapreduce applications under task and node failures (JAQR, CP, JS, JD), pp. 1225–1228.

SIGMOD-2011-SchallH #clustering #energy #named

WattDB: an energy-proportional cluster of wimpy nodes (DS, VH), pp. 1229–1232.

DLT-2011-HolzerKL

Nodes Connected by Path Languages (MH, MK, UL), pp. 276–287.

ICALP-v1-2011-Moldenhauer #algorithm #approximate #graph

Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (CM), pp. 748–759.

ECIR-2011-OhCM #classification #modelling #scalability #taxonomy #using

Text Classification for a Large-Scale Taxonomy Using Dynamically Mixed Local and Global Models for a Node (HSO, YC, SHM), pp. 7–18.

KDD-2011-MooreYZRL #classification #learning #network

Active learning for node classification in assortative and disassortative networks (CM, XY, YZ, JBR, TL), pp. 841–849.

SEKE-2011-FarahatE #fault #performance

Exploiting Computational Redundancy for Efficient Recovery from Soft Errors in Sensor Nodes (AF, AE), pp. 619–624.

DAC-2010-ChenW

Node addition and removal in the presence of don’t cares (YCC, CYW), pp. 505–510.

DAC-2010-PashaDS #architecture #generative #power management

A complete design-flow for the generation of ultra low-power WSN node architectures based on micro-tasking (MAP, SD, OS), pp. 693–698.

DATE-2010-AhlendorfG #challenge #design #hardware #monitoring #power management

Hardware / software design challenges of low-power sensor nodes for condition monitoring (HA, LG), p. 659.

DATE-2010-ProssGMJLHKS #configuration management #network

Demonstration of an in-band reconfiguration data distribution and network node reconfiguration (UP, SG, EM, MJ, JL, UH, JK, AS), pp. 614–617.

DATE-2010-UgryumovaS #algorithm #modelling #on the

On passivity of the super node algorithm for EM modeling of interconnect systems (MVU, WHAS), pp. 471–476.

DocEng-2010-ThaoM #data type #detection #using #version control #xml

Using versioned tree data structure, change detection and node identity for three-way XML merging (CT, EVM), pp. 77–86.

STOC-2010-Vegh

Augmenting undirected node-connectivity by one (LAV), pp. 563–572.

CIKM-2010-BonacicGMPT #concurrent #multi #performance #thread

Building efficient multi-threaded search nodes (CB, CG, MM, MPM, FT), pp. 1249–1258.

ECIR-2010-MendozaMFP #learning #query #web

Learning to Distribute Queries into Web Search Nodes (MM, MM, FF, BP), pp. 281–292.

ICPR-2010-YoonW #algorithm

Improved Mean Shift Algorithm with Heterogeneous Node Weights (JWY, SPW), pp. 4222–4225.

KDD-2010-WangCSX #algorithm #mining #mobile #network #social

Community-based greedy algorithm for mining top-K influential nodes in mobile social networks (YW, GC, GS, KX), pp. 1039–1048.

KEOD-2010-NairM #multi #network #using

Informledge System — A Modified Knowledge Network with Autonomous Nodes using Multi-lateral Links (TRGN, MM), pp. 351–354.

RecSys-2010-SymeonidisTM #network #predict #similarity #social #transitive

Transitive node similarity for link prediction in social networks with positive and negative links (PS, ET, YM), pp. 183–190.

SAC-2010-HeoGEKJ #energy #memory management #performance

Energy efficient program updating for sensor nodes with flash memory (JH, BG, SIE, PK, GJ), pp. 194–200.

SAC-2010-JanssenPW #graph #similarity

Estimating node similarity from co-citation in a spatial graph model (JJ, PP, RW), pp. 1329–1333.

SAC-2010-KimKPT #framework #hybrid #realtime #scheduling

Integrating real-time hybrid task scheduling into a sensor node platform (TK, BK, EKP, ST), pp. 737–741.

SAC-2010-NaceraHAM #ad hoc #clustering #network

A new two level hierarchy structuring for node partitioning in ad hoc networks (BN, HG, HA, MM), pp. 719–726.

PPoPP-2010-ZhaiCZ #named #parallel #performance #predict #scalability #using

PHANTOM: predicting performance of parallel applications on large-scale parallel machines using a single node (JZ, WC, WZ), pp. 305–314.

DAC-2009-RoyKG #interactive

Device/circuit interactions at 22nm technology node (KR, JPK, SKG), pp. 97–102.

DAC-2009-StrojwasJRP #using

Creating an affordable 22nm node using design-lithography co-optimization (AJS, TJ, VR, LTP), pp. 95–96.

DATE-2009-BildBD #performance #using

Minimization of NBTI performance degradation using internal node control (DRB, GEB, RPD), pp. 148–153.

DATE-2009-SubramanianGD #adaptation #configuration management #design #embedded #grid #network #online #policy

Online adaptation policy design for grid sensor networks with reconfigurable embedded nodes (VS, MG, AD), pp. 1273–1278.

ICALP-v1-2009-DemaineHK09a #graph

Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (EDD, MH, PNK), pp. 328–340.

LATA-2009-MitranaT #network #on the

On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes (VM, BT), pp. 588–600.

CIKM-2009-DewriRRW #identification #named

POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice (RD, IR, IR, DW), pp. 1037–1046.

SAC-2009-KumarZ #clustering #graph #visualisation

Visualization of clustered directed acyclic graphs with node interleaving (PK, KZ), pp. 1800–1805.

SOSP-2009-AndersenFKPTV #array #named #performance

FAWN: a fast array of wimpy nodes (DGA, JF, MK, AP, LT, VV), pp. 1–14.

ICLP-2009-Ashley-RollmanLGPC #independence #scalability

A Language for Large Ensembles of Independently Executing Nodes (MPAR, PL, SCG, PP, JC), pp. 265–280.

DAC-2008-CaseKMB

Merging nodes under sequential observability (MLC, VNK, AM, RKB), pp. 540–545.

DAC-2008-CheeKMPSBSRWS #energy #named

PicoCube: a 1 cm3 sensor node powered by harvested energy (YHC, MK, MM, NP, MS, FB, DS, JMR, PKW, SS), pp. 114–119.

DATE-2008-BrunelliBMT #energy #performance

An Efficient Solar Energy Harvester for Wireless Sensor Nodes (DB, LB, CM, LT), pp. 104–109.

DATE-2008-RinconPRZSAPM #energy #estimation #framework #network

OS-Based Sensor Node Platform and Energy Estimation Model for Health-Care Wireless Sensor Networks (FJR, MP, JR, QZ, MSE, DA, JP, GDM), pp. 1027–1032.

ICALP-A-2008-ChaintreauFL #network

Networks Become Navigable as Nodes Move and Forget (AC, PF, EL), pp. 133–144.

KDD-2008-YenSMS #difference #metric #product line

A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances (LY, MS, AM, MS), pp. 785–793.

SAC-2008-MaagG #approach #protocol #self #testing #using

Interoperability testing of a MANET routing protocol using a node self-similarity approach (SM, CG), pp. 1908–1912.

SAC-2008-SaffarianM #algorithm #novel #protocol

A novel protocol to prevent malicious nodes from misdirecting forward ants in AntNet algorithm (MS, MCM), pp. 1849–1853.

HPDC-2008-RaoHK #approach #peer-to-peer

An unstructured peer-to-peer approach to aggregate node selection (IR, AH, SK), pp. 209–212.

STOC-2007-Pap

Some new results on node-capacitated packing of A-paths (GP), pp. 599–604.

LATA-2007-AlhazovMR #network #predict

Networks of Evolutionary Processors with Two Nodes Are Unpredictable (AA, CMV, YR), pp. 521–528.

ICML-2007-AgarwalC #graph #learning #random #rank

Learning random walks to rank nodes in graphs (AA, SC), pp. 9–16.

TestCom-FATES-2007-GrepetM #ad hoc #protocol #self

Nodes Self-similarity to Test Wireless Ad Hoc Routing Protocols (CG, SM), pp. 123–137.

CASE-2006-LiZYC #algorithm #analysis #locality #network #novel

A Novel Algorithm for Node Localization and Motion Analysis in Wireless Sensor Networks (SL, DZ, ZY, NC), pp. 574–579.

DocEng-2006-Maitre #documentation #multi #xml

Describing multistructured XML documents by means of delay nodes (JLM), pp. 155–164.

DAC-2005-ChenardCZP #design

Design methodology for wireless nodes with printed antennas (JSC, CYC, ZZ, MP), pp. 291–296.

DATE-2005-GhoshG #distributed #locality #named #network #protocol #scheduling

LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks (AG, TG), pp. 190–195.

FASE-2005-MooijGR

Non-local Choice and Beyond: Intricacies of MSC Choice Nodes (AJM, NG, JR), pp. 273–288.

STOC-2005-Scheideler #exclamation #how

How to spread adversarial nodes?: rotate! (CS), pp. 704–713.

ICALP-2005-KempeKT #network #social

Influential Nodes in a Diffusion Model for Social Networks (DK, JMK, ÉT), pp. 1127–1138.

SFM-2005-GerlaCLZCYD #ad hoc #network

Dealing with Node Mobility in Ad Hoc Wireless Network (MG, LJC, YZL, BZ, JC, GY, SD), pp. 69–106.

MLDM-2005-BunkeDIK #analysis #graph #learning #predict

Analysis of Time Series of Graphs: Prediction of Node Presence by Means of Decision Tree Learning (HB, PJD, CI, MK), pp. 366–375.

SAC-2005-AnshulR #identification #network

A ZKP-based identification scheme for base nodes in wireless sensor networks (DA, SR), pp. 319–323.

SAC-2005-ZhengZOMF #clustering #network

Node clustering based on link delay in P2P networks (WZ, SZ, YO, FM, JF), pp. 744–749.

SIGMOD-2004-ONeilOPCSW #named #xml

ORDPATHs: Insert-Friendly XML Node Labels (PEO, EJO, SP, IC, GS, NW), pp. 903–908.

STOC-2004-KortsarzN #algorithm #approximate #graph

Approximation algorithm for k-node connected subgraphs via critical graphs (GK, ZN), pp. 138–145.

ICEIS-v4-2004-PuentesC #collaboration

Virtual Active IP Node for Collaborative Environments (FP, VC), pp. 49–54.

CIKM-2004-ChitrapuraK #graph #ranking

Node ranking in labeled directed graphs (KPC, SRK), pp. 597–606.

ASPLOS-2004-LowellSS #maintenance #online #virtual machine

Devirtualizable virtual machines enabling general, single-node, online maintenance (DEL, YS, EJS), pp. 211–223.

TestCom-2004-DibuzST #mobile #performance

BCMP Performance Test with TTCN-3 Mobile Node Emulator (SD, TS, ZT), pp. 50–59.

DocEng-2003-Vion-Dury #towards #xml #xpath

XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns (JYVD), pp. 19–25.

VLDB-2003-Koch #approach #performance #query #xml

Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach (CK), pp. 249–260.

MLDM-2003-CeciAM

Simplification Methods for Model Trees with Regression and Splitting Nodes (MC, AA, DM), pp. 20–34.

SEKE-2003-HuangL #abstraction #automation #graph #similarity #visualisation

Automatic Abstraction of Graphs Based on Node Similarity for Graph Visualization (XH, WL), pp. 111–118.

SAC-2002-FuTS #algorithm #similarity

Node splitting algorithms in tree-structured high-dimensional indexes for similarity search (YF, JCT, SRS), pp. 766–770.

WCRE-2001-HarmanHDHLF #calculus #slicing

Node Coarsening Calculi for Program Slicing (MH, RMH, SD, JH, MRL, CF), pp. 25–34.

STOC-2001-MossR #algorithm #approximate #problem

Approximation algorithms for constrained for constrained node weighted steiner tree problems (AM, YR), pp. 373–382.

DAC-2000-ZachariahCR #algorithm #novel

A novel algorithm to extract two-node bridges (STZ, SC, CDR), pp. 790–793.

DATE-2000-GulrajaniH #identification #logic #multi

Multi-Node Static Logic Implications for Redundancy Identification (KG, MSH), pp. 729–733.

ICPR-v2-2000-OlivieriV #image #prototype #similarity

Image Prototype Similarity Matching for Lymph Node Hemopathology (DNO, FV), pp. 2279–2282.

TestCom-2000-HorvathM #functional #testing #using

Functional Testing GPRS Support Nodes Using TTCN (EH, AM), pp. 229–238.

PLDI-1999-Vegdahl #graph #using

Using Node Merging to Enhance Graph Coloring (SRV), pp. 150–154.

ICEIS-1999-ReisM #network #what

What’s in a Node?-Nodes and Agents in Logistic Networks (JR, NJM), pp. 285–291.

PPoPP-1999-SubhlokLL #automation #network #performance

Automatic Node Selection for High Performance Applications on Networks (JS, PL, BL), pp. 163–172.

VLDB-1998-GarciaLL #on the

On Optimal Node Splitting for R-trees (YJG, MAL, STL), pp. 334–344.

TAGT-1998-JacquetK #approach

Node Replacement in Hypergraphs: Translating NCE Rewriting into the Pullback Approach (HJ, RKH), pp. 117–130.

TAGT-1998-SkodinisW

Neighborhood-Preserving Node Replacements (KS, EW), pp. 45–58.

CIKM-1998-LukF #database #object-oriented

Triple-Node Hierarchies for Object-Oriented Database Indexing (FHWL, AWCF), pp. 386–397.

ICML-1998-SalustowiczS #evolution #source code

Evolving Structured Programs with Hierarchical Instructions and Skip Nodes (RS, JS), pp. 488–496.

HT-1997-MukherjeaH #web

Focus + Context Views of World-Wide Web Nodes (SM, YH), pp. 187–196.

ICDAR-1997-ChungY #comparison #feature model #performance #recognition

Performance comparison of several feature selection methods based on node pruning in handwritten character recognition (KC, JY), pp. 11–15.

ICALP-1997-Fujito #approach #approximate #problem

A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties (TF), pp. 749–759.

ICALP-1997-KrumkeMNRRSW

Improving Spanning Trees by Upgrading Nodes (SOK, MVM, HN, RR, SSR, RS, HCW), pp. 281–291.

GG-Handbook-Vol1-EngelfrietR #graph grammar

Node Replacement Graph Grammars (JE, GR), pp. 1–94.

SAC-1997-Sibai #communication #multi #network

Multi-node communication in hyper-ring networks (FNS), pp. 380–383.

HPCA-1997-FalsafiW #communication #parallel #scheduling

Scheduling Communication on a SMP Node Parallel Machine (BF, DAW), pp. 128–138.

DAC-1996-GenderenM #performance #using

Using Articulation Nodes to Improve the Efficiency of Finite-Element based Resistance Extraction (AJvG, NPvdM), pp. 758–763.

STOC-1996-AggarwalKW #layout #trade-off

Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout (AA, JMK, DPW), pp. 585–594.

STOC-1996-CheriyanT #algorithm #performance

Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Extended Abstract) (JC, RT), pp. 37–46.

CC-1996-JanssenC

Controlled Node Splitting (JJ, HC), pp. 44–58.

VLDB-1995-EvangelidisLS #concurrent

The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation (GE, DBL, BS), pp. 551–561.

ICML-1995-Brodley #automation

Automatic Selection of Split Criterion during Tree Growing Based on Node Location (CEB), pp. 73–80.

POPL-1995-SreedharG #algorithm #linear

A Linear Time Algorithm for Placing phi-nodes (VCS, GRG), pp. 62–73.

SAC-1995-Li #algorithm #optimisation #performance #set

An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization (WNL), pp. 56–60.

DAC-1994-DahlgrenL #modelling #network

Modeling of Intermediate Node States in switch-Level Networks (PD, PL), pp. 722–727.

VLDB-1994-FuC #database #replication #transaction

A Transaction Replication Scheme for a Replicated Database with Node Autonomy (AWCF, DWLC), pp. 214–225.

ICALP-1994-GargVY #graph #multi

Multiway Cuts in Directed and Node Weighted Graphs (NG, VVV, MY), pp. 487–498.

TAGT-1994-Klempien-Hinrichs #confluence #decidability #simulation

Node Replacement in Hypergrahps: Simulation of Hyperedge Replacement, and Decidability of Confluence (RKH), pp. 397–411.

HT-ECHT-1992-Gibbs #hypermedia #video

Video Nodes and Video Webs: Uses of Video in Hypermedia (SJG), p. 3.

VLDB-1991-Joshi #adaptation #multi

Adaptive Locking Strategies in a Multi-node Data Sharing Environment (AMJ), pp. 181–191.

PPoPP-1991-FeeleyBCL #configuration management

Dynamic Node Reconfiguration in a Parallel-Distributed Environment (MJF, BNB, JSC, HML), pp. 114–121.

GG-1990-EngelfrietR #graph grammar

Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars (JE, GR), pp. 12–23.

ICALP-1984-SpencerM

Node Weighted Matching (THS, EWM), pp. 454–464.

GG-1982-JanssensR82a #graph grammar

Graph grammars with node-label controlled rewriting and embedding (DJ, GR), pp. 186–205.

STOC-1980-Storer #graph #grid

The Node Cost Measure for Embedding Graphs on the Planar Grid (Extended Abstract) (JAS), pp. 201–210.

STOC-1978-Yannakakis #problem

Node- and Edge-Deletion NP-Complete Problems (MY), pp. 253–264.

STOC-1975-AhoU #graph

Node Listings for Reducible Flow Graphs (AVA, JDU), pp. 177–185.

POPL-1975-Kennedy #analysis #data flow

Node Listings Applied to Data Flow Analysis (KK), pp. 10–21.