Stem dens$ (all stems)

105 papers:

CASE-2015-WatteyneAV #lessons learnt #scalability

Lessons learned from large-scale dense IEEE802.15.4 connectivity traces (TW, CA, XV), pp. 145–150.

DAC-2015-WangJZWY15a #memory management

Exploit imbalanced cell writes to mitigate write disturbance in dense phase change memory (RW, LJ, YZ, LW, JY), p. 6.

STOC-2015-Barman #approximate #nash #theorem

Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory’s Theorem (SB), pp. 361–369.

STOC-2015-BhattacharyaHNT #algorithm #maintenance

Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (SB, MH, DN, CET), pp. 173–182.

LATA-2015-BresolinMMSS #complexity #logic #on the

On the Complexity of Fragments of the Modal Logic of Allen’s Relations over Dense Structures (DB, DDM, AM, PS, GS), pp. 511–523.

KDD-2015-GionisT #tutorial

Dense Subgraph Discovery: KDD 2015 tutorial (AG, CET), pp. 2313–2314.

ASPLOS-2015-WangJZY #memory management #named #reliability

SD-PCM: Constructing Reliable Super Dense Phase Change Memory under Write Disturbance (RW, LJ, YZ, JY), pp. 19–31.

STOC-2014-GroheKS #first-order #graph

Deciding first-order properties of nowhere dense graphs (MG, SK, SS), pp. 89–98.

FLOPS-2014-CaiO #automaton

Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata (XC, MO), pp. 336–352.

LATA-2014-AbdullaAS #automaton #reachability

Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 62–75.

CHI-2014-MottW #lens #using

Beating the bubble: using kinematic triggering in the bubble lens for acquiring small, dense targets (MEM, JOW), pp. 733–742.

ICML-c2-2014-PapailiopoulosMDC #optimisation #rank

Finding Dense Subgraphs via Low-Rank Bilinear Optimization (DSP, IM, AGD, CC), pp. 1890–1898.

ICPR-2014-FilipVH #effectiveness

Effective Acquisition of Dense Anisotropic BRDF (JF, RV, MH), pp. 2047–2052.

STOC-2013-KeevashKM #polynomial

Polynomial-time perfect matchings in dense hypergraphs (PK, FK, RM), pp. 311–320.

HCI-III-2013-JuL #algorithm

A Dense Stereo Matching Algorithm with Occlusion and Less or Similar Texture Handling (HJ, CL), pp. 171–177.

ICML-c3-2013-KraehenbuehlK #convergence #learning #parametricity #random

Parameter Learning and Convergent Inference for Dense Random Fields (PK, VK), pp. 513–521.

DATE-2012-SahlbachWE

A high-performance dense block matching solution for automotive 6D-vision (HS, SW, RE), pp. 268–271.

VLDB-2012-AgarwalRB #clustering #graph #identification #realtime

Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments (MKA, KR, MB), pp. 980–991.

VLDB-2012-AngelKSS #identification #maintenance #realtime #streaming

Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification (AA, NK, NS, DS), pp. 574–585.

DLT-2012-KrebsL

Dense Completeness (AK, KJL), pp. 178–189.

ICPR-2012-FangC #re-engineering

Dense reconstruction by stereo-motion under perspective camera model (MF, RC), pp. 2480–2483.

ICPR-2012-IwasakiKN #segmentation

Dense motion segmentation of articulated objects in crowds (MI, AK, KN), pp. 861–865.

PPoPP-2012-DuBBHD #fault tolerance #matrix

Algorithm-based fault tolerance for dense matrix factorizations (PD, AB, GB, TH, JD), pp. 225–234.

PPoPP-2012-MarkerTPBG #algebra #developer #linear

Mechanizing the expert dense linear algebra developer (BM, AT, JP, DSB, RAvdG), pp. 289–290.

LICS-2012-AbdullaAS #automaton

Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 35–44.

LICS-2012-MullerT #random

Short Propositional Refutations for Dense Random 3CNF Formulas (SM, IT), pp. 501–510.

ICDAR-2011-Saund #approach #graph #image #maintenance

A Graph Lattice Approach to Maintaining Dense Collections of Subgraphs as Image Features (ES), pp. 1069–1074.

LATA-2011-Blanchet-SadriBZ #word

Unary Pattern Avoidance in Partial Words Dense with Holes (FBS, KB, AZ), pp. 155–166.

VLDB-2010-AggarwalLYJ #graph #mining #on the

On Dense Pattern Mining in Graph Streams (CCA, YL, PSY, RJ), pp. 975–984.

VLDB-2011-WangZTT10 #graph #on the

On Triangulation-based Dense Neighborhood Graphs Discovery (NW, JZ, KLT, AKHT), pp. 58–68.

ICPR-2010-BanerjeeK #detection #modelling

Model-Based Detection of Acoustically Dense Objects in Ultrasound (JB, KBK), pp. 4166–4169.

ICPR-2010-DaoS #recognition #robust

A Robust Recognition Technique for Dense Checkerboard Patterns (VND, MS), pp. 3081–3084.

ICPR-2010-KimM #classification #dataset

Dense Structure Inference for Object Classification in Aerial LIDAR Dataset (EK, GGM), pp. 3049–3052.

ICPR-2010-KoskenkorvaKB

Quasi-dense Wide Baseline Matching for Three Views (PK, JK, SSB), pp. 806–809.

ICPR-2010-Mattoccia #consistency

Accurate Dense Stereo by Constraining Local Consistency on Superpixels (SM), pp. 1832–1835.

ICPR-2010-PapalazarouRW #detection #estimation #image #multi #using

Multiple Model Estimation for the Detection of Curvilinear Segments in Medical X-ray Images Using Sparse-plus-dense-RANSAC (CP, PMJR, PHNdW), pp. 2484–2487.

ICPR-2010-RaraAESF #re-engineering #recognition #using

Face Recognition at-a-Distance Using Texture, Dense- and Sparse-Stereo Reconstruction (HMR, AMA, SYE, TLS, AAF), pp. 1221–1224.

SIGIR-2010-ArvolaKJ #documentation

Focused access to sparsely and densely relevant documents (PA, JK, MJ), pp. 781–782.

SAC-2010-RosswogG #clustering #detection #mobile

Efficiently detecting clusters of mobile objects in the presence of dense noise (JR, KG), pp. 1095–1102.

SAC-2010-ZhouS #ad hoc #energy #network #performance #throughput #towards

Towards higher throughput and energy efficiency in dense wireless ad hoc and sensor networks (WZ, RS), pp. 749–755.

PPoPP-2010-ChandramowlishwaranKV #algebra #concurrent #linear #parallel #programming

Applying the concurrent collections programming model to asynchronous parallel dense linear algebra (AC, KK, RWV), pp. 345–346.

DAC-2009-KongYW #automation

Automatic bus planner for dense PCBs (HK, TY, MDFW), pp. 326–331.

ICALP-v1-2009-KhullerS #on the

On Finding Dense Subgraphs (SK, BS), pp. 597–608.

PPoPP-2009-Quintana-OrtiIQG #hardware #linear #multi

Solving dense linear systems on platforms with multiple hardware accelerators (GQO, FDI, ESQO, RAvdG), pp. 121–130.

DATE-2008-BonnyH #embedded #encoding

Instruction Re-encoding Facilitating Dense Embedded Code (TB, JH), pp. 770–775.

FM-2008-FuriaPR #approximate #automation #specification #verification

Automated Verification of Dense-Time MTL Specifications Via Discrete-Time Approximation (CAF, MP, MR), pp. 132–147.

ICPR-2008-RohithSKG #estimation #image #scalability #towards

Towards estimation of dense disparities from stereo images containing large textureless regions (MVR, GS, CK, CAG), pp. 1–5.

KDD-2008-YuDL #feature model

Stable feature selection via dense feature groups (LY, CHQD, SL), pp. 803–811.

SAC-2008-SchiabelSA #detection #image #segmentation

Segmentation technique for detecting suspect masses in dense breast digitized images as a tool for mammography CAD schemes (HS, VTS, MFA), pp. 1333–1337.

PPoPP-2008-DiamondRKGGB #algebra #distributed #linear #performance

High performance dense linear algebra on a spatially distributed processor (JRD, BR, SWK, RAvdG, KG, DB), pp. 63–72.

DAC-2007-Ozdal #clustering

Escape Routing For Dense Pin Clusters In Integrated Circuits (MMO), pp. 49–54.

CIKM-2007-LangA #graph

Finding dense and isolated submarkets in a sponsored search spending graph (KJL, RA), pp. 613–622.

SAC-2007-FeydyS #equation #integer #linear

Propagating dense systems of integer linear equations (TF, PJS), pp. 306–310.

ICML-2006-LeordeanuH #approximate #energy #performance

Efficient MAP approximation for dense energy functions (ML, MH), pp. 545–552.

ICPR-v2-2006-ScalzoP #learning

Unsupervised Learning of Dense Hierarchical Appearance Represe (FS, JHP), pp. 395–398.

ICPR-v3-2006-HeasMP #estimation

Dense Estimation of Layer Motions in the Atmosphere (PH, ÉM, NP), pp. 1–4.

KDD-2006-ZengWZK #clique #database #graph #scalability

Coherent closed quasi-clique discovery from large dense graph databases (ZZ, JW, LZ, GK), pp. 797–802.

DATE-2005-BougardCDCD #energy #modelling #network #performance #standard

Energy Efficiency of the IEEE 802.15.4 Standard in Dense Wireless Microsensor Networks: Modeling and Improvement Perspectives (BB, FC, DCD, AC, WD), pp. 196–201.

VLDB-2005-GibsonKT #graph #scalability

Discovering Large Dense Subgraphs in Massive Graphs (DG, RK, AT), pp. 721–732.

PPoPP-2005-LowGZ #algebra #algorithm #linear #parallel #specification

Extracting SMP parallelism for dense linear algebra algorithms from high-level specifications (TML, RAvdG, FGVZ), pp. 153–163.

DAC-2004-TakayanagiSPSL

A dual-core 64b ultraSPARC microprocessor for dense server applications (TT, JLS, BP, JS, ASL), pp. 673–677.

SIGMOD-2004-QianZZ #approach #clustering #effectiveness #named #performance

FAÇADE: A Fast and Effective Approach to the Discovery of Dense Clusters in Noisy Spatial Data (YQ, GZ, KZ), pp. 921–922.

ICPR-v1-2004-JiaZLA

A Miniature Stereo Vision Machine (MSVM-III) for Dense Disparity Mapping (YJ, XZ, ML, LA), pp. 728–731.

ICPR-v2-2004-MachidaTY #estimation

Dense Estimation of Surface Reflectance Properties Based on Inverse Global Illumination Rendering (TM, HT, NY), pp. 895–898.

ICPR-v3-2004-JagmohanSA #estimation #kernel #using

Dense Stereo Matching Using Kernel Maximum Likelihood Estimation (AJ, MKS, NA), pp. 28–31.

ICPR-v3-2004-MaoSCA #3d

Constructing Dense Correspondences to Analyze 3D Facial Change (ZM, JPS, WPC, AFA), pp. 144–148.

ICPR-v4-2004-ArnabatCM #3d #consistency #modelling #multi #sequence #using

3D Modeling from Turntable Sequences Using Dense Stereo Carving and Multi-View Consistency (JA, SC, GGM), pp. 36–39.

ICPR-v4-2004-GenovesioO #multi

Split and Merge Data Association Filter for Dense Multi-target Tracking (AG, JCOM), pp. 677–680.

ICPR-v4-2004-IvekovicT

Dense Wide-Baseline Disparities from Conventional Stereo for Immersive Videoconferencing (SI, ET), pp. 921–924.

ICPR-v4-2004-LeungALS #approach #energy #re-engineering

An Energy Minimisation Approach to Stereo-Temporal Dense Reconstruction (CL, BA, BCL, CS), pp. 72–75.

ICPR-v4-2004-OtsukaM #analysis #multi

A Particle Filter for Tracking Densely Populated Objects Based on Explicit Multiview Occlusion Analysis (KO, NM), pp. 745–750.

KDD-2004-SeppanenM

Dense itemsets (JKS, HM), pp. 683–688.

ASE-2003-StrelzoffP #requirements #user interface

Deriving User Interface Requirements from Densely Interleaved Scientific Computing Applications (AS, LRP), pp. 22–29.

CIAA-2003-WangHY #analysis

TCTL Inevitability Analysis of Dense-Time Systems (FW, GDH, FY), pp. 176–187.

ICALP-2003-GarganoH #graph #how

There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them) (LG, MH), pp. 802–816.

CAV-2003-XieDIP #problem #verification

Dense Counter Machines and Verification Problems (GX, ZD, OHI, PSP), pp. 93–105.

TACAS-2002-Ouaknine #abstraction #model checking

Digitisation and Full Abstraction for Dense-Time Model Checking (JO), pp. 37–51.

ICPR-v1-2002-LiuCR #adaptation #estimation #parametricity #using

Accurate Dense Optical Flow Estimation Using Adaptive Structure Tensors and a Parametric Model (HL, RC, AR), pp. 291–294.

ICPR-v1-2002-MachidaY #estimation

Dense Estimation of Surface Reflectance Properties of Objects with Interreflections (TM, NY), pp. 348–351.

ICPR-v2-2002-YangP02a #re-engineering

High-Resolution Reconstruction of Sparse Data from Dense Low-Resolution Spatio-Temporal Data (QY, BP), pp. 261–264.

ICPR-v3-2002-BurschkaH #classification

Scene Classification from Dense Disparity Maps in Indoor Environments (DB, GDH), pp. 708–712.

ICPR-v3-2002-CampbellF #recognition #using

Recognition of Free-Form Objects in Dense Range Data Using Local Features (RJC, PJF), pp. 607–610.

ICPR-v3-2002-StefanoMMN #constraints

Dense Stereo Based on the Uniqueness Constraint (LdS, MM, SM, GN), pp. 657–661.

LICS-2002-FaellaTM #game studies #realtime

Dense Real-Time Games (MF, SLT, AM), pp. 167–176.

CAV-2001-Dang #analysis #automaton #reachability

Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks (ZD), pp. 506–518.

ICPR-v1-2000-BaillardHB #3d #segmentation #set

Cooperation between Level Set Techniques and Dense 3D Registration for the Segmentation of Brain Structures (CB, PH, CB), pp. 1991–1994.

ICPR-v1-2000-LhuillierQ #constraints #geometry #robust #using

Robust Dense Matching Using Local and Global Geometric Constraints (ML, LQ), pp. 1968–1972.

ICPR-v1-2000-SpiesJB

Dense Range Flow from Depth and Intensity Data (HS, BJ, JLB), pp. 1131–1134.

DATE-1999-ToulouseBLN #3d #modelling #performance

Efficient 3D Modelling for Extraction of Interconnect Capacitances in Deep Submicron Dense Layouts (AT, DB, CL, PN), pp. 576–580.

STOC-1999-AmbainisNTV #automaton #bound #quantum

Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata (AA, AN, ATS, UVV), pp. 376–383.

FM-v1-1999-TripakisA #on the fly #synthesis

On-the-Fly Controller Synthesis for Discrete and Dense-Time Systems (ST, KA), pp. 233–252.

TACAS-1997-RaskinS #abstraction #logic #realtime

Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time (JFR, PYS), pp. 165–182.

STOC-1997-AwerbuchS #algorithm #multi #online

Online Algorithms for Selective Multicast and Maximal Dense Trees (BA, TS), pp. 354–362.

ICALP-1996-JennerV #performance

Fast Asynchronous Systems in Dense Time (LJ, WV), pp. 75–86.

PODS-1995-GrumbachS #constraints #database

Dense-Order Constraint Databases (SG, JS), pp. 66–77.

STOC-1995-AroraKK #approximate #np-hard #polynomial #problem

Polynomial time approximation schemes for dense instances of NP-hard problems (SA, DRK, MK), pp. 284–293.

ILPS-1995-Brzoska #logic programming

Temporal Logic Programming in Dense Time (CB), pp. 303–317.

DAC-1992-OkudaO #algorithm #generative #layout #performance

An Efficient Routing Algorithm for SOG Cell Generation on a Dense Gate-Isolated Layout Style (RO, SO), pp. 676–681.

KR-1992-Koubarakis #constraints #exclamation

Dense Time and Temporal Constraints with != (MK), pp. 24–35.

ICALP-1991-Furer #algorithm #graph #performance

An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (MF), pp. 429–440.

ICALP-1991-GalilM #algorithm #linear #problem

An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (ZG, OM), pp. 719–727.

ICALP-1988-Niemi

Maximal Dense Intervals of Grammar Forms (VN), pp. 424–438.

SIGMOD-1986-Willard #algorithm #worst-case

Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files (DEW), pp. 251–260.

STOC-1982-Willard #maintenance

Maintaining Dense Sequential Files in a Dynamic Environment (Extended Abstract) (DEW), pp. 114–121.

DAC-1978-Raeger #design #interactive #using

The design of a dense PCB using an interactive DA system (DR), p. 454.