Search results for "traversals"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
93	Karl J. Lieberherr, Boaz Patt-Shamir, Doug Orleans	Traversals of object structures: Specification and Efficient Implementation.	ACM Trans. Program. Lang. Syst.	2004	DBLP DOI BibTeX RDF	Low of Demeter, adaptive programming, class graphs, strategy graphs, structure-shy software, Aspect-oriented programming, object graphs
82	David Taniar	Optimizing Object-Oriented Collection Join Queries through Path Traversals.	TOOLS (32)	1999	DBLP DOI BibTeX RDF	Object-Oriented Query Processing, Path Traversals, Collection Join Queries and Object-Oriented Query Optimization
74	David Taniar	Forward vs. Reverse Traversal in Path Expression Query Processing.	TOOLS (28)	1998	DBLP DOI BibTeX RDF	Forward Traversals, Reverse Traversals, Object-Oriented Query Processing, Path Expression Queries and Performance Evaluation
69	Runian Geng, Xiangjun Dong, He Jiang, Wenbo Xu 0001	WTSPMiner: Efficiently Mining Weighted Sequential Patterns from Directed Graph Traversals.	ICIC (1)	2008	DBLP DOI BibTeX RDF	weighted directed graph, traversal pattern mining, weighted sequential pattern mining, data mining
57	Ivan Stojmenovic	Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	parenthesis matching, parallel algorithm, broadcast, sorting, selection, reduction, Binary tree, parallel prefix, tree traversals
57	Stephan Olariu, C. Michael Overstreet, Zhaofang Wen	An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals.	ICCI	1991	DBLP DOI BibTeX RDF	Algorithms, Parallel algorithms, PRAM, Binary trees, Traversals, Ordered trees
57	Runian Geng, Xiangjun Dong, Guoling Liu, Wenbo Xu 0001	Efficiently Mining Maximal Frequent Patterns from Traversals on Weighted Directed Graph Using Statistical Theory.	FSKD (2)	2008	DBLP DOI BibTeX RDF
49	Greg Stitt, Gaurav Chaudhari, James Coole	Traversal caches: a first step towards FPGA acceleration of pointer-based data structures.	CODES+ISSS	2008	DBLP DOI BibTeX RDF	traversal cache, fpga, synthesis, hardware/software partitioning, pointers, cad
49	Neil Mitchell, Colin Runciman	Uniform boilerplate and list processing.	Haskell	2007	DBLP DOI BibTeX RDF
49	Seungryul Choi, Nicholas Kohout, Sumit Pamnani, Dongkeun Kim, Donald Yeung	A general framework for prefetch scheduling in linked data structures and its application to multi-chain prefetching.	ACM Trans. Comput. Syst.	2004	DBLP DOI BibTeX RDF	memory parallelism, pointer-chasing code, Data prefetching
45	Sergey Bereg, David G. Kirkpatrick	Curvature-bounded traversals of narrow corridors.	SCG	2005	DBLP DOI BibTeX RDF	curvarure-bounded traversals, computational geometry, motion planning
45	Andrew L. Burrow	Algorithm Design Using Traversals of the Covering Relation.	ICCS	2009	DBLP DOI BibTeX RDF
45	Sumant Tambe, Aniruddha S. Gokhale	LEESA: Embedding Strategic and XPath-Like Object Structure Traversals in C++.	DSL	2009	DBLP DOI BibTeX RDF
45	Runian Geng, Wenbo Xu 0001, Xiangjun Dong	WTPMiner: Efficient Mining of Weighted Frequent Patterns Based on Graph Traversals.	KSEM	2007	DBLP DOI BibTeX RDF	WDG, Data mining, frequent patterns, traversal patterns
45	Johan Ovlinger, Mitchell Wand	A Language for Specifying Recursive Traversals of Object Structures.	OOPSLA	1999	DBLP DOI BibTeX RDF	Java, separation of concerns, visitor pattern, recursive programming
45	Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi, Akihiko Takano	Tupling Calculation Eliminates Multiple Data Traversals.	ICFP	1997	DBLP DOI BibTeX RDF
37	Janis Voigtländer	Using circular programs to deforest in accumulating parameters.	ASIA-PEPM	2002	DBLP DOI BibTeX RDF	accumulating parameters, intermediate data structures, lazy composition, multiple traversals, program transformation, lazy evaluation, tupling, deforestation, circular programs
37	Mårten Björkman, Fredrik Dahlgren, Per Stenström	Using hints to reduce the read miss penalty for flat COMA protocols.	HICSS (1)	1995	DBLP DOI BibTeX RDF	read miss penalty, flat COMA protocols, flat cache-only memory architectures, attraction-memory miss, directory interrogation, network traversals, data copy holder identity tracking, benchmark applications, protocol complexity, performance evaluation, transaction processing, memory architecture, cache storage, performance improvement, hints, architectural simulations, memory protocols
36	Deling Ren, Martin Erwig	A generic recursion toolbox for Haskell or: scrap your boilerplate systematically.	Haskell	2006	DBLP DOI BibTeX RDF	traversal strategy, generic programming
36	Adrian Johnstone, Elizabeth Scott	Generalised Regular Parsers.	CC	2003	DBLP DOI BibTeX RDF
36	Georges Gardarin, Rosana S. G. Lanzelotte	Optimizing Object-Oriented Datbase Queries using Cost-Controlled Rewriting.	EDBT	1992	DBLP DOI BibTeX RDF
36	Rosana S. G. Lanzelotte, Patrick Valduriez, Mikal Ziane, Jean-Pierre Cheiney	Optimization of Nonrecursive Queries in OODBs.	DOOD	1991	DBLP DOI BibTeX RDF
33	Gianpiero Cabodi, Sergio Nocco, Stefano Quer	Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification.	CAV	2002	DBLP DOI BibTeX RDF
33	Michael A. Bender, Richard Cole 0001, Erik D. Demaine, Martin Farach-Colton	Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy.	ESA	2002	DBLP DOI BibTeX RDF
33	Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Pino Persiano	Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals).	STACS	2001	DBLP DOI BibTeX RDF	distributed systems, approximation algorithms, networks, Multicasting
33	David R. Musser, Arturo J. Sánchez-Ruíz	Theory and Generality of Complete Traversals.	Generic Programming	1998	DBLP DOI BibTeX RDF	Standard Template Library (STL), Adaptors, Iteration Mechanisms, Generic Programming, Iterators, Containers, Closures
33	Peter A. Boncz, Fred Kwakkel, Martin L. Kersten	High Performance Support for OO Traversals in Monet.	BNCOD	1996	DBLP DOI BibTeX RDF	Database programming languages Database architectures, Database Techniques, Performance, Benchmarking, Object oriented databases, Parallel Systems
33	Stanley Y. W. Su, Herman Lam, Der Her Lo	Transformation of Data Traversals and Operations in Application Programs to Account for Semantic Changes of Databases.	ACM Trans. Database Syst.	1981	DBLP DOI BibTeX RDF	application program conversion, database changes, access pattern, semantic data model, transformation rules
25	Bryan Chadwick, Karl J. Lieberherr	A type system for functional traversal-based aspects.	FOAL	2009	DBLP DOI BibTeX RDF	adaptive programming, functional aspects, traversals, type soundness
25	Kemafor Anyanwu, Amit P. Sheth	?-Queries: enabling querying for semantic associations on the semantic web.	WWW	2003	DBLP DOI BibTeX RDF	complex data relationships, semantic web querying, RDF, semantic associations, graph traversals
25	Werner E. Kluge	Traversing Binary Tree Structures with Shift-Register Memories.	IEEE Trans. Computers	1977	DBLP DOI BibTeX RDF	Data permutations, traversal control, tree structures, shift-register memories, tree traversals
24	Shamima Yasmin, Abdullah Zawawi Talib	A New Approach for Surface Reconstruction Using Slices.	ICCS (2)	2009	DBLP DOI BibTeX RDF	Surface Reconstruction, Contours, Boundary
24	Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng	Fast object search on road networks.	EDBT	2009	DBLP DOI BibTeX RDF	road network, spatial search
24	João Paulo Fernandes, João Saraiva	Tools and libraries to model and manipulate circular programs.	PEPM	2007	DBLP DOI BibTeX RDF	intermediate data structures, multiple traversal algorithms, traversal scheduling, circular programming
24	Shantanu Das 0001, Paola Flocchini, Amiya Nayak, Nicola Santoro	Effective Elections for Anonymous Mobile Agents.	ISAAC	2006	DBLP DOI BibTeX RDF
24	Shantanu Das 0001, Shay Kutten, Ayelet Yifrach	Improved Distributed Exploration of Anonymous Networks.	ICDCN	2006	DBLP DOI BibTeX RDF	unlabeled nodes, asynchronous distributed leader election, k agents, map construction, anonymous network
24	Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc	Tree Exploration with an Oracle.	MFCS	2006	DBLP DOI BibTeX RDF
24	Martin F. O'Connor, Zohra Bellahsene, Mark Roantree	An Extended Preorder Index for Optimising XPath Expressions.	XSym	2005	DBLP DOI BibTeX RDF
24	Shantanu Das 0001, Paola Flocchini, Amiya Nayak, Nicola Santoro	Distributed Exploration of an Unknown Graph.	SIROCCO	2005	DBLP DOI BibTeX RDF
24	Jianhan Zhu, Jun Hong 0001, John G. Hughes	PageCluster: Mining conceptual link hierarchies from Web log files for adaptive Web site navigation.	ACM Trans. Internet Techn.	2004	DBLP DOI BibTeX RDF	Link hierarchies, Web site navigation, bibliographic analysis, conceptual link hierarchies, link similarity, clustering
24	Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano	Iterative-free program analysis.	ICFP	2003	DBLP DOI BibTeX RDF	SP term, dynamic programming, program analysis, register allocation, control flow graph, tree width, catamorphism
24	Li-min Liu, Michael Halper, James Geller, Yehoshua Perl	Using OODB Modeling to Partition a Vocabulary in Structurally and Semantically Uniform Concept Groups.	IEEE Trans. Knowl. Data Eng.	2002	DBLP DOI BibTeX RDF	knowledge representation, Object-oriented databases, object-oriented models, object-oriented systems, database models
24	Anders Dessmark, Andrzej Pelc	Optimal Graph Exploration without Good Maps.	ESA	2002	DBLP DOI BibTeX RDF
24	Torsten Grust	Accelerating XPath location steps.	SIGMOD Conference	2002	DBLP DOI BibTeX RDF	XML
24	Gianpiero Cabodi, Paolo Camurati, Stefano Quer	Can BDDs compete with SAT solvers on bounded model checking?	DAC	2002	DBLP DOI BibTeX RDF	model checking, formal verification, SAT, BDDs
24	Nicholas Kohout, Seungryul Choi, Dongkeun Kim, Donald Yeung	Multi-Chain Prefetching: Effective Exploitation of Inter-Chain Memory Parallelism for Pointer-Chasing Codes.	IEEE PACT	2001	DBLP DOI BibTeX RDF
24	Gianpiero Cabodi, Paolo Camurati, Stefano Quer	Improving symbolic reachability analysis by means of activityprofiles.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2000	DBLP DOI BibTeX RDF
24	Andreas Hett, Christoph Scholl 0001, Bernd Becker 0001	Distance driven finite state machine traversal.	DAC	2000	DBLP DOI BibTeX RDF
24	Xiaotie Deng, Evangelos E. Milios, Andy Mirzaian	Robot Map Verification of a Graph World.	WADS	1999	DBLP DOI BibTeX RDF
24	Eelco Visser	Strategic Pattern Matching.	RTA	1999	DBLP DOI BibTeX RDF
24	Charles J. Alpert, Andrew B. Kahng	A general framework for vertex orderings with applications to circuit clustering.	IEEE Trans. Very Large Scale Integr. Syst.	1996	DBLP DOI BibTeX RDF
24	Barbara Liskov, Atul Adya, Miguel Castro 0001, Mark Day, Sanjay Ghemawat, Robert Gruber, Umesh Maheshwari, Andrew C. Myers, Liuba Shrira	Safe and Efficient Sharing of Persistent Objects in Thor.	SIGMOD Conference	1996	DBLP DOI BibTeX RDF
24	Georges Gardarin, Fernando Machuca, Philippe Pucheral	OFL: A Functional Execution Model for Object Query Languages.	SIGMOD Conference	1995	DBLP DOI BibTeX RDF
24	Lawrence Rauchwerger, David A. Padua	Parallelizing while loops for multiprocessor systems.	IPPS	1995	DBLP DOI BibTeX RDF	parallelizing while loops, do loops, conditional exits, sequential constructs, data dependence relations, sparse matrix packages, multiprocessing systems, multiprocessor systems, program compilers, parallelizing compilers, parallelising compilers, linked lists, iteration space, sparse matrix computations
24	François Barthélemy, Éric Villemonte de la Clergerie	Subsumption-oriented Push-Down Automata.	PLILP	1992	DBLP DOI BibTeX RDF
20	Andrew Choi, Dezhong Tong, Brian Park, Demetri Terzopoulos, Jungseock Joo, Mohammad Khalid Jawed	mBEST: Realtime Deformable Linear Object Detection Through Minimal Bending Energy Skeleton Pixel Traversals.	IEEE Robotics Autom. Lett.	2023	DBLP DOI BibTeX RDF
20	Andrew Choi, Dezhong Tong, Brian Park, Demetri Terzopoulos, Jungseock Joo, Mohammad Khalid Jawed	mBEST: Realtime Deformable Linear Object Detection Through Minimal Bending Energy Skeleton Pixel Traversals.	CoRR	2023	DBLP DOI BibTeX RDF
20	Yue Song, Andy Keller, Nicu Sebe, Max Welling	Latent Traversals in Generative Models as Potential Flows.	CoRR	2023	DBLP DOI BibTeX RDF
20	Reece Neff, Mostafa Eghbali Zarch, Marco Minutoli, Mahantesh Halappanavar, Antonino Tumeo, Ananth Kalyanaraman, Michela Becchi	Fused Breadth-First Probabilistic Traversals on Distributed GPU Systems.	CoRR	2023	DBLP DOI BibTeX RDF
20	Yupeng Tang, Seung-Seob Lee, Anurag Khandelwal	CHASE: Accelerating Distributed Pointer-Traversals on Disaggregated Memory.	CoRR	2023	DBLP DOI BibTeX RDF
20	Marcel Hallgarten, Martin Stoll, Andreas Zell	From Prediction to Planning With Goal Conditioned Lane Graph Traversals.	CoRR	2023	DBLP DOI BibTeX RDF
20	Yurong You, Cheng Perng Phoo, Katie Z. Luo, Travis Zhang, Wei-Lun Chao, Bharath Hariharan, Mark E. Campbell, Kilian Q. Weinberger	Unsupervised Adaptation from Repeated Traversals for Autonomous Driving.	CoRR	2023	DBLP DOI BibTeX RDF
20	Jaewook Byun	Enabling Time-Centric Computation for Efficient Temporal Graph Traversals From Multiple Sources (Extended abstract).	ICDE	2023	DBLP DOI BibTeX RDF
20	Xizhe Yin, Zhijia Zhao 0001, Rajiv Gupta 0001	Taming Misaligned Graph Traversals in Concurrent Graph Processing (Abstract).	HOPC@SPAA	2023	DBLP DOI BibTeX RDF
20	Jiafeng Yang, Xihan Li 0004, Zhibin Tian, Zhiqiang Wang, Rujin Han, Zihao Yuan, Ruinan Mu, Haifeng Zhao	Design of a Lunar Regolith Sampling System for Large-Scale Rover Traversals.	RCAR	2023	DBLP DOI BibTeX RDF
20	Abhishek Madan, Carolina Nobre	Visualizing Query Traversals Over Bounding Volume Hierarchies Using Treemaps.	IEEE VIS (Short Papers)	2023	DBLP DOI BibTeX RDF
20	Marcel Hallgarten, Martin Stoll, Andreas Zell	From Prediction to Planning With Goal Conditioned Lane Graph Traversals.	ITSC	2023	DBLP DOI BibTeX RDF
20	Yue Song, T. Anderson Keller, Nicu Sebe, Max Welling	Latent Traversals in Generative Models as Potential Flows.	ICML	2023	DBLP BibTeX RDF
20	Xizhe Yin, Zhijia Zhao 0001, Rajiv Gupta 0001	Glign: Taming Misaligned Graph Traversals in Concurrent Graph Processing.	ASPLOS (1)	2023	DBLP DOI BibTeX RDF
20	Jaewook Byun	Enabling Time-Centric Computation for Efficient Temporal Graph Traversals From Multiple Sources.	IEEE Trans. Knowl. Data Eng.	2022	DBLP DOI BibTeX RDF
20	Guha Balakrishnan, Raghudeep Gadde, Aleix Martinez, Pietro Perona	Rayleigh EigenDirections (REDs): GAN latent space traversals for multidimensional features.	CoRR	2022	DBLP BibTeX RDF
20	Yurong You, Katie Z. Luo, Xiangyu Chen, Junan Chen, Wei-Lun Chao, Wen Sun, Bharath Hariharan, Mark E. Campbell, Kilian Q. Weinberger	Hindsight is 20/20: Leveraging Past Traversals to Aid 3D Perception.	CoRR	2022	DBLP DOI BibTeX RDF
20	Gershom Bazerman	A Totally Predictable Outcome: An Investigation of Traversals of Infinite Structures.	CoRR	2022	DBLP DOI BibTeX RDF
20	Maricel A. Esclamado, Maria Mercedes T. Rodrigo	Are All Who Wander Lost? An Exploratory Analysis of Learner Traversals of Minecraft Worlds.	AIED (2)	2022	DBLP DOI BibTeX RDF
20	Jonathan D. L. Casano, Maria Mercedes T. Rodrigo	A Comparative Assessment of US and PH Learner Traversals and In-Game Observations within Minecraft.	AIED (2)	2022	DBLP DOI BibTeX RDF
20	Yurong You, Cheng Perng Phoo, Katie Luo, Travis Zhang, Wei-Lun Chao, Bharath Hariharan, Mark Campbell 0001, Kilian Q. Weinberger	Unsupervised Adaptation from Repeated Traversals for Autonomous Driving.	NeurIPS	2022	DBLP BibTeX RDF
20	Guha Balakrishnan, Raghudeep Gadde, Aleix Martinez, Pietro Perona	Rayleigh EigenDirections (REDs): Nonlinear GAN Latent Space Traversals for Multidimensional Features.	ECCV (17)	2022	DBLP DOI BibTeX RDF
20	Gershom Bazerman	A totally predictable outcome: an investigation of traversals of infinite structures.	Haskell	2022	DBLP DOI BibTeX RDF
20	Asma Ghandeharioun, Been Kim, Chun-Liang Li, Brendan Jou, Brian Eoff, Rosalind W. Picard	DISSECT: Disentangled Simultaneous Explanations via Concept Traversals.	ICLR	2022	DBLP BibTeX RDF
20	Yurong You, Katie Z. Luo, Xiangyu Chen, Junan Chen, Wei-Lun Chao, Wen Sun, Bharath Hariharan, Mark E. Campbell, Kilian Q. Weinberger	Hindsight is 20/20: Leveraging Past Traversals to Aid 3D Perception.	ICLR	2022	DBLP BibTeX RDF
20	Chaitanya Koparkar, Mike Rainey, Michael Vollmer 0003, Milind Kulkarni 0001, Ryan R. Newton	Efficient tree-traversals: reconciling parallelism and dense data representations.	Proc. ACM Program. Lang.	2021	DBLP DOI BibTeX RDF
20	Chaitanya Koparkar, Mike Rainey, Michael Vollmer 0003, Milind Kulkarni 0001, Ryan R. Newton	Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations.	CoRR	2021	DBLP BibTeX RDF
20	Asma Ghandeharioun, Been Kim, Chun-Liang Li, Brendan Jou, Brian Eoff, Rosalind W. Picard	DISSECT: Disentangled Simultaneous Explanations via Concept Traversals.	CoRR	2021	DBLP BibTeX RDF
20	Siddharth Bhaskar, Robin Kaarsgaard	Graph Traversals as Universal Constructions.	CoRR	2021	DBLP BibTeX RDF
20	Oded Green	ButterFly BFS - An Efficient Communication Pattern for Multi Node Traversals.	CoRR	2021	DBLP BibTeX RDF
20	Nachiket Deo, Eric M. Wolff, Oscar Beijbom	Multimodal Trajectory Prediction Conditioned on Lane-Graph Traversals.	CoRR	2021	DBLP BibTeX RDF
20	Luk Burchard, Johannes Moe, Daniel Thilo Schroeder, Konstantin Pogorelov, Johannes Langguth	iPUG: Accelerating Breadth-First Graph Traversals Using Manycore Graphcore IPUs.	ISC	2021	DBLP DOI BibTeX RDF
20	Soheil Khodayari, Giancarlo Pellegrino	JAW: Studying Client-side CSRF with Hybrid Property Graphs and Declarative Traversals.	USENIX Security Symposium	2021	DBLP BibTeX RDF
20	Siddharth Bhaskar, Robin Kaarsgaard	Graph Traversals as Universal Constructions.	MFCS	2021	DBLP DOI BibTeX RDF
20	Nachiket Deo, Eric M. Wolff, Oscar Beijbom	Multimodal Trajectory Prediction Conditioned on Lane-Graph Traversals.	CoRL	2021	DBLP BibTeX RDF
20	Yanjun Wang, Jinwei Liu, Dalin Zhang 0003, Xiaokang Qiu	Reasoning about recursive tree traversals.	PPoPP	2021	DBLP DOI BibTeX RDF
20	Oded Green	Inverse-Deletion BFS - Revisiting Static Graph BFS Traversals with Dynamic Graph Operations.	HPEC	2021	DBLP DOI BibTeX RDF
20	Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea, Adam Morrison 0001, Aleksandar Nanevski, Noam Rinetzky, Sharon Shoham	Proving highly-concurrent traversals correct.	Proc. ACM Program. Lang.	2020	DBLP DOI BibTeX RDF
20	Jaewook Byun, Daeyoung Kim 0001	Object traceability graph: Applying temporal graph traversals for efficient object traceability.	Expert Syst. Appl.	2020	DBLP DOI BibTeX RDF
20	Samuel Henrique Silva, Adel Alaeddini, Peyman Najafirad	Temporal Graph Traversals Using Reinforcement Learning With Proximal Policy Optimization.	IEEE Access	2020	DBLP DOI BibTeX RDF
20	William Blum	Evaluating lambda terms with traversals.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
20	Jaewook Byun, Sungpil Woo, Daeyoung Kim 0001	ChronoGraph: Enabling Temporal Graph Traversals for Efficient Information Diffusion Analysis over Time.	IEEE Trans. Knowl. Data Eng.	2020	DBLP DOI BibTeX RDF
20	Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea, Adam Morrison 0001, Aleksandar Nanevski, Noam Rinetzky, Sharon Shoham	Proving Highly-Concurrent Traversals Correct.	CoRR	2020	DBLP BibTeX RDF
20	Mario Román	Profunctor optics and traversals.	CoRR	2020	DBLP BibTeX RDF
20	Jaewook Byun, Sungpil Woo, Daeyoung Kim 0001	ChronoGraph: Enabling temporal graph traversals for efficient information diffusion analysis over time.	ICDE	2020	DBLP DOI BibTeX RDF